./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/bitvector/byte_add_2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/bitvector/byte_add_2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 09:32:28,288 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 09:32:28,291 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 09:32:28,359 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 09:32:28,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 09:32:28,363 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 09:32:28,365 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 09:32:28,370 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 09:32:28,373 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 09:32:28,375 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 09:32:28,376 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 09:32:28,377 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 09:32:28,378 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 09:32:28,382 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 09:32:28,383 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 09:32:28,385 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 09:32:28,386 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 09:32:28,387 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 09:32:28,390 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 09:32:28,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 09:32:28,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 09:32:28,396 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 09:32:28,398 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 09:32:28,399 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 09:32:28,406 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 09:32:28,406 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 09:32:28,407 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 09:32:28,408 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 09:32:28,408 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 09:32:28,409 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 09:32:28,409 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 09:32:28,410 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 09:32:28,411 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 09:32:28,412 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 09:32:28,413 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 09:32:28,414 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 09:32:28,415 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 09:32:28,415 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 09:32:28,415 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 09:32:28,416 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 09:32:28,416 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 09:32:28,418 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-16 09:32:28,447 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 09:32:28,447 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 09:32:28,448 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 09:32:28,448 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 09:32:28,449 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 09:32:28,449 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 09:32:28,449 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 09:32:28,450 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-16 09:32:28,450 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-16 09:32:28,450 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-16 09:32:28,451 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-16 09:32:28,451 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-16 09:32:28,451 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-16 09:32:28,451 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 09:32:28,451 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 09:32:28,452 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 09:32:28,452 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 09:32:28,452 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 09:32:28,452 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 09:32:28,452 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-16 09:32:28,452 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-16 09:32:28,453 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-16 09:32:28,453 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 09:32:28,453 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 09:32:28,454 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-16 09:32:28,454 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 09:32:28,454 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-16 09:32:28,455 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 09:32:28,455 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 09:32:28,455 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 09:32:28,455 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 09:32:28,456 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 09:32:28,457 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-16 09:32:28,457 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba [2021-12-16 09:32:28,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 09:32:28,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 09:32:28,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 09:32:28,724 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 09:32:28,725 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 09:32:28,726 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_2-2.i [2021-12-16 09:32:28,780 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7483a2b45/d3b31bf7765f47888bf94b84b4c5bb47/FLAG5fa6d9b0b [2021-12-16 09:32:29,182 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 09:32:29,186 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i [2021-12-16 09:32:29,201 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7483a2b45/d3b31bf7765f47888bf94b84b4c5bb47/FLAG5fa6d9b0b [2021-12-16 09:32:29,589 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7483a2b45/d3b31bf7765f47888bf94b84b4c5bb47 [2021-12-16 09:32:29,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 09:32:29,594 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 09:32:29,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 09:32:29,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 09:32:29,601 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 09:32:29,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:32:29" (1/1) ... [2021-12-16 09:32:29,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d0873ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:32:29, skipping insertion in model container [2021-12-16 09:32:29,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:32:29" (1/1) ... [2021-12-16 09:32:29,609 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 09:32:29,629 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 09:32:29,803 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i[1168,1181] [2021-12-16 09:32:29,860 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 09:32:29,868 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 09:32:29,884 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i[1168,1181] [2021-12-16 09:32:29,909 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 09:32:29,922 INFO L208 MainTranslator]: Completed translation [2021-12-16 09:32:29,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:32:29 WrapperNode [2021-12-16 09:32:29,923 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 09:32:29,924 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 09:32:29,925 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 09:32:29,925 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 09:32:29,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:32:29" (1/1) ... [2021-12-16 09:32:29,945 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:32:29" (1/1) ... [2021-12-16 09:32:29,971 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 123 [2021-12-16 09:32:29,972 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 09:32:29,972 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 09:32:29,973 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 09:32:29,973 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 09:32:29,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:32:29" (1/1) ... [2021-12-16 09:32:29,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:32:29" (1/1) ... [2021-12-16 09:32:29,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:32:29" (1/1) ... [2021-12-16 09:32:29,992 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:32:29" (1/1) ... [2021-12-16 09:32:29,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:32:29" (1/1) ... [2021-12-16 09:32:30,007 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:32:29" (1/1) ... [2021-12-16 09:32:30,008 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:32:29" (1/1) ... [2021-12-16 09:32:30,010 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 09:32:30,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 09:32:30,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 09:32:30,017 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 09:32:30,018 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:32:29" (1/1) ... [2021-12-16 09:32:30,023 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:30,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:30,047 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:30,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-16 09:32:30,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 09:32:30,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 09:32:30,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 09:32:30,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 09:32:30,136 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 09:32:30,138 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 09:32:30,362 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 09:32:30,391 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 09:32:30,392 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-16 09:32:30,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:32:30 BoogieIcfgContainer [2021-12-16 09:32:30,394 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 09:32:30,395 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-16 09:32:30,395 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-16 09:32:30,397 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-16 09:32:30,398 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 09:32:30,398 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.12 09:32:29" (1/3) ... [2021-12-16 09:32:30,399 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@277907f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.12 09:32:30, skipping insertion in model container [2021-12-16 09:32:30,400 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 09:32:30,400 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:32:29" (2/3) ... [2021-12-16 09:32:30,400 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@277907f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.12 09:32:30, skipping insertion in model container [2021-12-16 09:32:30,400 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 09:32:30,400 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:32:30" (3/3) ... [2021-12-16 09:32:30,401 INFO L388 chiAutomizerObserver]: Analyzing ICFG byte_add_2-2.i [2021-12-16 09:32:30,465 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-16 09:32:30,479 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-16 09:32:30,479 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-16 09:32:30,479 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-16 09:32:30,480 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-16 09:32:30,480 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-16 09:32:30,480 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-16 09:32:30,480 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-16 09:32:30,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41 states, 40 states have (on average 1.75) internal successors, (70), 40 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:30,521 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2021-12-16 09:32:30,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:30,522 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:30,530 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-16 09:32:30,531 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:30,531 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-16 09:32:30,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41 states, 40 states have (on average 1.75) internal successors, (70), 40 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:30,535 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2021-12-16 09:32:30,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:30,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:30,536 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-16 09:32:30,536 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:30,553 INFO L791 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 13#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 5#L59true assume !(0 == mp_add_~a3~0#1 % 256); 17#L59-1true mp_add_~nb~0#1 := 4; 19#L69true assume !(0 == mp_add_~b3~0#1 % 256); 36#L69-1true mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 24#L80-2true [2021-12-16 09:32:30,554 INFO L793 eck$LassoCheckResult]: Loop: 24#L80-2true assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 33#L83true assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 42#L83-1true assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 8#L89true assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 40#L95-1true assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 18#L99-1true assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 12#L100-1true assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 28#L101-1true assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 31#L102-1true mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 24#L80-2true [2021-12-16 09:32:30,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:30,559 INFO L85 PathProgramCache]: Analyzing trace with hash 889938151, now seen corresponding path program 1 times [2021-12-16 09:32:30,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:30,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861170069] [2021-12-16 09:32:30,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:30,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:30,693 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:32:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:30,766 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:32:30,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:30,769 INFO L85 PathProgramCache]: Analyzing trace with hash 318197182, now seen corresponding path program 1 times [2021-12-16 09:32:30,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:30,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022231897] [2021-12-16 09:32:30,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:30,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:30,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:30,889 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:30,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022231897] [2021-12-16 09:32:30,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022231897] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:30,890 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:30,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 09:32:30,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961446305] [2021-12-16 09:32:30,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:30,894 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:30,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:30,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 09:32:30,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 09:32:30,927 INFO L87 Difference]: Start difference. First operand has 41 states, 40 states have (on average 1.75) internal successors, (70), 40 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:31,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:31,055 INFO L93 Difference]: Finished difference Result 64 states and 94 transitions. [2021-12-16 09:32:31,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 09:32:31,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 94 transitions. [2021-12-16 09:32:31,066 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2021-12-16 09:32:31,074 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 56 states and 86 transitions. [2021-12-16 09:32:31,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2021-12-16 09:32:31,075 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2021-12-16 09:32:31,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 86 transitions. [2021-12-16 09:32:31,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:31,076 INFO L681 BuchiCegarLoop]: Abstraction has 56 states and 86 transitions. [2021-12-16 09:32:31,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 86 transitions. [2021-12-16 09:32:31,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2021-12-16 09:32:31,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.5555555555555556) internal successors, (84), 53 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:31,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 84 transitions. [2021-12-16 09:32:31,096 INFO L704 BuchiCegarLoop]: Abstraction has 54 states and 84 transitions. [2021-12-16 09:32:31,096 INFO L587 BuchiCegarLoop]: Abstraction has 54 states and 84 transitions. [2021-12-16 09:32:31,097 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-16 09:32:31,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 84 transitions. [2021-12-16 09:32:31,098 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2021-12-16 09:32:31,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:31,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:31,098 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:31,098 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:31,098 INFO L791 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 127#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 114#L59 assume !(0 == mp_add_~a3~0#1 % 256); 115#L59-1 mp_add_~nb~0#1 := 4; 132#L69 assume !(0 == mp_add_~b3~0#1 % 256); 123#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 138#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 139#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 129#L83-1 [2021-12-16 09:32:31,099 INFO L793 eck$LassoCheckResult]: Loop: 129#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 118#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 119#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 133#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 125#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 126#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 144#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 147#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 159#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 160#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 135#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 141#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 128#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 129#L83-1 [2021-12-16 09:32:31,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:31,099 INFO L85 PathProgramCache]: Analyzing trace with hash 532072804, now seen corresponding path program 1 times [2021-12-16 09:32:31,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:31,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586985514] [2021-12-16 09:32:31,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:31,100 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:31,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:31,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:31,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586985514] [2021-12-16 09:32:31,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586985514] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:31,287 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:31,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 09:32:31,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443807189] [2021-12-16 09:32:31,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:31,290 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:32:31,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:31,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1939143242, now seen corresponding path program 1 times [2021-12-16 09:32:31,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:31,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230780873] [2021-12-16 09:32:31,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:31,301 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:31,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:31,385 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:31,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230780873] [2021-12-16 09:32:31,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230780873] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:31,387 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:31,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 09:32:31,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378864724] [2021-12-16 09:32:31,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:31,388 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:31,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:31,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 09:32:31,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 09:32:31,390 INFO L87 Difference]: Start difference. First operand 54 states and 84 transitions. cyclomatic complexity: 32 Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:31,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:31,681 INFO L93 Difference]: Finished difference Result 149 states and 228 transitions. [2021-12-16 09:32:31,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 09:32:31,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 228 transitions. [2021-12-16 09:32:31,685 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 108 [2021-12-16 09:32:31,686 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 149 states and 228 transitions. [2021-12-16 09:32:31,686 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 149 [2021-12-16 09:32:31,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 149 [2021-12-16 09:32:31,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 228 transitions. [2021-12-16 09:32:31,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:31,688 INFO L681 BuchiCegarLoop]: Abstraction has 149 states and 228 transitions. [2021-12-16 09:32:31,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 228 transitions. [2021-12-16 09:32:31,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 78. [2021-12-16 09:32:31,694 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-12-16 09:32:31,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 113 transitions. [2021-12-16 09:32:31,695 INFO L704 BuchiCegarLoop]: Abstraction has 78 states and 113 transitions. [2021-12-16 09:32:31,695 INFO L587 BuchiCegarLoop]: Abstraction has 78 states and 113 transitions. [2021-12-16 09:32:31,695 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-16 09:32:31,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 113 transitions. [2021-12-16 09:32:31,697 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2021-12-16 09:32:31,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:31,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:31,698 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:31,698 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:31,698 INFO L791 eck$LassoCheckResult]: Stem: 354#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 343#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 333#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 335#L61 assume !(0 == mp_add_~a2~0#1 % 256); 336#L59-1 mp_add_~nb~0#1 := 4; 350#L69 assume !(0 == mp_add_~b3~0#1 % 256); 341#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 380#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 381#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 402#L83-1 [2021-12-16 09:32:31,698 INFO L793 eck$LassoCheckResult]: Loop: 402#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 404#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 372#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 373#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 403#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 362#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 363#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 364#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 378#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 368#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 352#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 357#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 358#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 402#L83-1 [2021-12-16 09:32:31,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:31,699 INFO L85 PathProgramCache]: Analyzing trace with hash -384676570, now seen corresponding path program 1 times [2021-12-16 09:32:31,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:31,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822067758] [2021-12-16 09:32:31,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:31,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:31,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:31,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:31,788 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:31,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822067758] [2021-12-16 09:32:31,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822067758] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:31,788 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:31,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 09:32:31,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316582118] [2021-12-16 09:32:31,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:31,789 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:32:31,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:31,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1939143242, now seen corresponding path program 2 times [2021-12-16 09:32:31,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:31,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118427758] [2021-12-16 09:32:31,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:31,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:31,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:31,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:31,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118427758] [2021-12-16 09:32:31,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118427758] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:31,857 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:31,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 09:32:31,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366729068] [2021-12-16 09:32:31,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:31,858 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:31,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:31,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 09:32:31,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-16 09:32:31,860 INFO L87 Difference]: Start difference. First operand 78 states and 113 transitions. cyclomatic complexity: 37 Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:32,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:32,205 INFO L93 Difference]: Finished difference Result 226 states and 344 transitions. [2021-12-16 09:32:32,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 09:32:32,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 226 states and 344 transitions. [2021-12-16 09:32:32,209 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 161 [2021-12-16 09:32:32,211 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 226 states to 226 states and 344 transitions. [2021-12-16 09:32:32,211 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 226 [2021-12-16 09:32:32,212 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 226 [2021-12-16 09:32:32,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 226 states and 344 transitions. [2021-12-16 09:32:32,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:32,213 INFO L681 BuchiCegarLoop]: Abstraction has 226 states and 344 transitions. [2021-12-16 09:32:32,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states and 344 transitions. [2021-12-16 09:32:32,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 78. [2021-12-16 09:32:32,219 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-12-16 09:32:32,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 113 transitions. [2021-12-16 09:32:32,233 INFO L704 BuchiCegarLoop]: Abstraction has 78 states and 113 transitions. [2021-12-16 09:32:32,233 INFO L587 BuchiCegarLoop]: Abstraction has 78 states and 113 transitions. [2021-12-16 09:32:32,233 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-16 09:32:32,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 113 transitions. [2021-12-16 09:32:32,234 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2021-12-16 09:32:32,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:32,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:32,235 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:32,235 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:32,235 INFO L791 eck$LassoCheckResult]: Stem: 676#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 665#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 655#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 657#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 658#L63 assume !(0 == mp_add_~a1~0#1 % 256); 659#L59-1 mp_add_~nb~0#1 := 4; 703#L69 assume !(0 == mp_add_~b3~0#1 % 256); 699#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 700#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 705#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 693#L83-1 [2021-12-16 09:32:32,236 INFO L793 eck$LassoCheckResult]: Loop: 693#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 653#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 654#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 692#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 660#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 661#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 683#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 695#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 696#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 689#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 674#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 679#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 680#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 693#L83-1 [2021-12-16 09:32:32,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:32,236 INFO L85 PathProgramCache]: Analyzing trace with hash -2089936051, now seen corresponding path program 1 times [2021-12-16 09:32:32,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:32,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347521803] [2021-12-16 09:32:32,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:32,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:32,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:32,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:32,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:32,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347521803] [2021-12-16 09:32:32,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347521803] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:32,390 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:32,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 09:32:32,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383536620] [2021-12-16 09:32:32,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:32,391 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:32:32,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:32,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1939143242, now seen corresponding path program 3 times [2021-12-16 09:32:32,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:32,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589591032] [2021-12-16 09:32:32,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:32,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:32,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:32,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:32,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:32,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589591032] [2021-12-16 09:32:32,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589591032] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:32,438 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:32,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 09:32:32,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126852159] [2021-12-16 09:32:32,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:32,439 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:32,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:32,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 09:32:32,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-16 09:32:32,440 INFO L87 Difference]: Start difference. First operand 78 states and 113 transitions. cyclomatic complexity: 37 Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:33,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:33,363 INFO L93 Difference]: Finished difference Result 376 states and 549 transitions. [2021-12-16 09:32:33,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-16 09:32:33,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 376 states and 549 transitions. [2021-12-16 09:32:33,371 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 267 [2021-12-16 09:32:33,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 376 states to 376 states and 549 transitions. [2021-12-16 09:32:33,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 376 [2021-12-16 09:32:33,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 376 [2021-12-16 09:32:33,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 376 states and 549 transitions. [2021-12-16 09:32:33,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:33,376 INFO L681 BuchiCegarLoop]: Abstraction has 376 states and 549 transitions. [2021-12-16 09:32:33,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states and 549 transitions. [2021-12-16 09:32:33,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 222. [2021-12-16 09:32:33,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 222 states have (on average 1.454954954954955) internal successors, (323), 221 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:33,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 323 transitions. [2021-12-16 09:32:33,388 INFO L704 BuchiCegarLoop]: Abstraction has 222 states and 323 transitions. [2021-12-16 09:32:33,388 INFO L587 BuchiCegarLoop]: Abstraction has 222 states and 323 transitions. [2021-12-16 09:32:33,388 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-16 09:32:33,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 222 states and 323 transitions. [2021-12-16 09:32:33,390 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 135 [2021-12-16 09:32:33,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:33,390 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:33,391 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:33,391 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:33,391 INFO L791 eck$LassoCheckResult]: Stem: 1164#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 1152#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 1140#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 1142#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 1144#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 1145#L59-1 mp_add_~nb~0#1 := 4; 1189#L69 assume !(0 == mp_add_~b3~0#1 % 256); 1185#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 1186#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1286#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 1330#L83-1 [2021-12-16 09:32:33,391 INFO L793 eck$LassoCheckResult]: Loop: 1330#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 1312#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 1297#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 1296#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 1295#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 1294#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 1291#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 1288#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1289#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 1177#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 1336#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 1335#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 1333#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 1330#L83-1 [2021-12-16 09:32:33,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:33,392 INFO L85 PathProgramCache]: Analyzing trace with hash -2147194353, now seen corresponding path program 1 times [2021-12-16 09:32:33,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:33,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053935307] [2021-12-16 09:32:33,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:33,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:33,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:33,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:33,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053935307] [2021-12-16 09:32:33,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053935307] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:33,494 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:33,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 09:32:33,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78030280] [2021-12-16 09:32:33,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:33,494 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:32:33,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:33,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1939143242, now seen corresponding path program 4 times [2021-12-16 09:32:33,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:33,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503797751] [2021-12-16 09:32:33,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:33,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:33,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:33,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:33,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503797751] [2021-12-16 09:32:33,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503797751] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:33,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:33,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 09:32:33,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368733606] [2021-12-16 09:32:33,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:33,547 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:33,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:33,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 09:32:33,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-16 09:32:33,549 INFO L87 Difference]: Start difference. First operand 222 states and 323 transitions. cyclomatic complexity: 107 Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:34,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:34,344 INFO L93 Difference]: Finished difference Result 287 states and 416 transitions. [2021-12-16 09:32:34,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-16 09:32:34,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 287 states and 416 transitions. [2021-12-16 09:32:34,347 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 188 [2021-12-16 09:32:34,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 287 states to 287 states and 416 transitions. [2021-12-16 09:32:34,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 287 [2021-12-16 09:32:34,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 287 [2021-12-16 09:32:34,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 287 states and 416 transitions. [2021-12-16 09:32:34,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:34,350 INFO L681 BuchiCegarLoop]: Abstraction has 287 states and 416 transitions. [2021-12-16 09:32:34,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states and 416 transitions. [2021-12-16 09:32:34,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 246. [2021-12-16 09:32:34,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 246 states have (on average 1.4593495934959348) internal successors, (359), 245 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:34,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 359 transitions. [2021-12-16 09:32:34,360 INFO L704 BuchiCegarLoop]: Abstraction has 246 states and 359 transitions. [2021-12-16 09:32:34,360 INFO L587 BuchiCegarLoop]: Abstraction has 246 states and 359 transitions. [2021-12-16 09:32:34,360 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-16 09:32:34,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 246 states and 359 transitions. [2021-12-16 09:32:34,362 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 162 [2021-12-16 09:32:34,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:34,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:34,362 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:34,362 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:34,363 INFO L791 eck$LassoCheckResult]: Stem: 1701#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 1690#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 1678#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 1680#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 1682#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 1683#L59-1 mp_add_~nb~0#1 := 4; 1695#L69 assume !(0 == mp_add_~b3~0#1 % 256); 1716#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 1703#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1704#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 1698#L84 [2021-12-16 09:32:34,363 INFO L793 eck$LassoCheckResult]: Loop: 1698#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 1699#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 1715#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 1912#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 1910#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 1908#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 1906#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 1896#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 1903#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 1892#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 1890#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 1721#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1722#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 1698#L84 [2021-12-16 09:32:34,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:34,363 INFO L85 PathProgramCache]: Analyzing trace with hash -2147194379, now seen corresponding path program 1 times [2021-12-16 09:32:34,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:34,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613415289] [2021-12-16 09:32:34,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:34,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:34,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:34,374 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:32:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:34,385 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:32:34,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:34,386 INFO L85 PathProgramCache]: Analyzing trace with hash -135428754, now seen corresponding path program 5 times [2021-12-16 09:32:34,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:34,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516069301] [2021-12-16 09:32:34,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:34,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:34,391 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:32:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:34,407 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:32:34,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:34,407 INFO L85 PathProgramCache]: Analyzing trace with hash -578820102, now seen corresponding path program 1 times [2021-12-16 09:32:34,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:34,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889409608] [2021-12-16 09:32:34,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:34,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:34,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:34,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:34,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889409608] [2021-12-16 09:32:34,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889409608] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:34,475 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:34,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 09:32:34,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179626867] [2021-12-16 09:32:34,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:34,588 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:32:34,589 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:32:34,589 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:32:34,589 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:32:34,589 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-16 09:32:34,589 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:34,589 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:32:34,590 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:32:34,590 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration6_Loop [2021-12-16 09:32:34,590 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:32:34,590 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:32:34,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:32:34,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:32:34,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:32:34,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:32:34,801 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:32:34,803 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-16 09:32:34,804 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:34,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:34,808 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:34,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-16 09:32:34,810 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:32:34,810 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:32:34,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-12-16 09:32:34,854 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:34,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:34,855 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:34,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-16 09:32:34,864 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-16 09:32:34,864 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:32:35,403 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-16 09:32:35,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-16 09:32:35,409 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:32:35,409 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:32:35,410 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:32:35,410 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:32:35,410 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:32:35,410 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:35,410 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:32:35,410 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:32:35,410 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration6_Loop [2021-12-16 09:32:35,410 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:32:35,410 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:32:35,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:32:35,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:32:35,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:32:35,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:32:35,613 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:32:35,617 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:32:35,617 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:35,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:35,619 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:35,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-16 09:32:35,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-12-16 09:32:35,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:32:35,627 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:35,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:35,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:35,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:32:35,629 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:32:35,629 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:35,630 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:35,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-16 09:32:35,645 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:35,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:35,646 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:35,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-16 09:32:35,648 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:35,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:32:35,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:35,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:35,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:35,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:32:35,657 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:32:35,657 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:35,663 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:35,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-16 09:32:35,679 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:35,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:35,680 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:35,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-16 09:32:35,682 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:35,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:32:35,688 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:35,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:35,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:35,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:32:35,691 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:32:35,691 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:35,693 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:35,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-12-16 09:32:35,708 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:35,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:35,709 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:35,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-16 09:32:35,711 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:35,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:32:35,718 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:35,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:35,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:35,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:32:35,719 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:32:35,719 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:35,734 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:35,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2021-12-16 09:32:35,750 INFO L490 LassoAnalysis]: Using template '2-nested'. [2021-12-16 09:32:35,750 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:35,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:35,751 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:35,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-12-16 09:32:35,752 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:35,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:32:35,758 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:35,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:35,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:35,758 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-16 09:32:35,759 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-16 09:32:35,759 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:35,760 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:35,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2021-12-16 09:32:35,776 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:35,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:35,776 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:35,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-12-16 09:32:35,779 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:35,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:32:35,785 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:35,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:35,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:35,785 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-16 09:32:35,789 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-16 09:32:35,789 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:35,797 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:35,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-12-16 09:32:35,813 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:35,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:35,814 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:35,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-16 09:32:35,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-12-16 09:32:35,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:32:35,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:35,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:35,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:35,821 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-16 09:32:35,825 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-16 09:32:35,825 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:35,835 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:35,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-12-16 09:32:35,850 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:35,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:35,851 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-12-16 09:32:35,852 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-12-16 09:32:35,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:35,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:32:35,860 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:35,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:35,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:35,860 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-16 09:32:35,861 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-16 09:32:35,861 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:35,862 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:35,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-12-16 09:32:35,878 INFO L490 LassoAnalysis]: Using template '3-nested'. [2021-12-16 09:32:35,879 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:35,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:35,880 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-12-16 09:32:35,880 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-12-16 09:32:35,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:35,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:32:35,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:35,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:35,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:35,889 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:32:35,890 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:32:35,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:35,891 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:35,906 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-12-16 09:32:35,906 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:35,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:35,907 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-12-16 09:32:35,909 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-12-16 09:32:35,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-12-16 09:32:35,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:32:35,919 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:35,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:35,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:35,919 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:32:35,924 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:32:35,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:35,931 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:35,946 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-12-16 09:32:35,947 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:35,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:35,948 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-12-16 09:32:35,949 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-12-16 09:32:35,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:35,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:32:35,958 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:35,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:35,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:35,959 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:32:35,963 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:32:35,963 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:35,995 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:36,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-12-16 09:32:36,015 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:36,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:36,016 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-12-16 09:32:36,017 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-12-16 09:32:36,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:36,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:32:36,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:36,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:36,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:36,067 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:32:36,068 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:32:36,068 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:36,069 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:36,087 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-12-16 09:32:36,087 INFO L490 LassoAnalysis]: Using template '4-nested'. [2021-12-16 09:32:36,088 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:36,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:36,090 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-12-16 09:32:36,091 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-12-16 09:32:36,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:36,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:32:36,099 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:36,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:36,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:36,099 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-16 09:32:36,100 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-16 09:32:36,100 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:36,102 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:36,117 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-12-16 09:32:36,117 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:36,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:36,118 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-12-16 09:32:36,119 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-12-16 09:32:36,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:36,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:32:36,127 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:36,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:36,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:36,128 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-16 09:32:36,133 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-16 09:32:36,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:36,179 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:36,196 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-12-16 09:32:36,197 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:36,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:36,203 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-12-16 09:32:36,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:36,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:32:36,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:36,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:36,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:36,216 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-16 09:32:36,218 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-12-16 09:32:36,221 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-16 09:32:36,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:36,243 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:36,259 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-12-16 09:32:36,259 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:36,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:36,260 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-12-16 09:32:36,261 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-12-16 09:32:36,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-12-16 09:32:36,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:32:36,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:36,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:36,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:36,270 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-16 09:32:36,270 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-16 09:32:36,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:36,272 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:36,287 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-12-16 09:32:36,288 INFO L490 LassoAnalysis]: Using template '2-phase'. [2021-12-16 09:32:36,288 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:36,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:36,288 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-12-16 09:32:36,295 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-12-16 09:32:36,295 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:36,303 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:36,303 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-16 09:32:36,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:36,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:36,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:36,304 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-16 09:32:36,305 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-16 09:32:36,305 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:36,314 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:36,331 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-12-16 09:32:36,332 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:36,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:36,332 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:36,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-12-16 09:32:36,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:36,341 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:36,341 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-16 09:32:36,341 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:36,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:36,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:36,341 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-16 09:32:36,347 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-16 09:32:36,348 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:36,364 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:36,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2021-12-16 09:32:36,380 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:36,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:36,381 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:36,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-12-16 09:32:36,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:36,389 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:36,389 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-16 09:32:36,389 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:36,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:36,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:36,390 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-16 09:32:36,392 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-16 09:32:36,392 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:36,397 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:36,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2021-12-16 09:32:36,413 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:36,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:36,414 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:36,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-12-16 09:32:36,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-12-16 09:32:36,421 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:36,421 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-16 09:32:36,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:36,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:36,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:36,422 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-16 09:32:36,422 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-16 09:32:36,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:36,423 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:36,438 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-12-16 09:32:36,438 INFO L490 LassoAnalysis]: Using template '3-phase'. [2021-12-16 09:32:36,439 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:36,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:36,439 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:36,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-12-16 09:32:36,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:36,448 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:36,448 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-12-16 09:32:36,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:36,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:36,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:36,448 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:32:36,449 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:32:36,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:36,453 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:36,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-12-16 09:32:36,469 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:36,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:36,470 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:36,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-12-16 09:32:36,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:36,478 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:36,479 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-12-16 09:32:36,479 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:36,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:36,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:36,479 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:32:36,483 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:32:36,483 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:36,493 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:36,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2021-12-16 09:32:36,508 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:36,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:36,509 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:36,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-12-16 09:32:36,512 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:36,518 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:36,518 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-12-16 09:32:36,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:36,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:36,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:36,518 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:32:36,522 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:32:36,522 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:36,534 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:36,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-12-16 09:32:36,550 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:36,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:36,550 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:36,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-12-16 09:32:36,553 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:36,559 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:36,559 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-12-16 09:32:36,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:36,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:36,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:36,559 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:32:36,560 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:32:36,560 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:36,562 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:36,577 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-12-16 09:32:36,578 INFO L490 LassoAnalysis]: Using template '4-phase'. [2021-12-16 09:32:36,578 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:36,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:36,579 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:36,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-12-16 09:32:36,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:36,588 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:36,588 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-16 09:32:36,588 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:36,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:36,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:36,588 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-16 09:32:36,589 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-16 09:32:36,589 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:36,592 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:36,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2021-12-16 09:32:36,607 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:36,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:36,608 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:36,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-12-16 09:32:36,610 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:36,616 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:36,616 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-16 09:32:36,617 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:36,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:36,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:36,617 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-16 09:32:36,623 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-16 09:32:36,623 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:36,647 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:36,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2021-12-16 09:32:36,673 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:36,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:36,674 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:36,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:36,687 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:36,687 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-16 09:32:36,688 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:36,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:36,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:36,688 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-16 09:32:36,694 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-16 09:32:36,694 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:36,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-12-16 09:32:36,711 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:36,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2021-12-16 09:32:36,737 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:36,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:36,738 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:36,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:36,750 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:36,751 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-16 09:32:36,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:36,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:36,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:36,751 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-16 09:32:36,752 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-16 09:32:36,752 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:36,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-12-16 09:32:36,771 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:36,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2021-12-16 09:32:36,796 INFO L490 LassoAnalysis]: Using template '2-lex'. [2021-12-16 09:32:36,796 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:36,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:36,797 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:36,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-12-16 09:32:36,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:36,807 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:36,807 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-16 09:32:36,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:36,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:36,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:36,807 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:32:36,809 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:32:36,809 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:36,824 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:36,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2021-12-16 09:32:36,847 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:36,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:36,848 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:36,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:36,858 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:36,858 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-16 09:32:36,858 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:36,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:36,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:36,859 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:32:36,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-12-16 09:32:36,863 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:32:36,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:36,890 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:36,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2021-12-16 09:32:36,905 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:36,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:36,906 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:36,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-12-16 09:32:36,908 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:36,914 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:36,914 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-16 09:32:36,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:36,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:36,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:36,914 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:32:36,918 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:32:36,918 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:36,933 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:36,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2021-12-16 09:32:36,948 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:36,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:36,949 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:36,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-12-16 09:32:36,958 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:36,964 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:36,964 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-16 09:32:36,964 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:36,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:36,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:36,964 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:32:36,965 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:32:36,965 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:36,966 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:36,981 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-12-16 09:32:36,981 INFO L490 LassoAnalysis]: Using template '3-lex'. [2021-12-16 09:32:36,981 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:36,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:36,982 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:36,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-12-16 09:32:36,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-12-16 09:32:36,989 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:36,989 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-16 09:32:36,990 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:36,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:36,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:36,990 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-12-16 09:32:36,991 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:32:36,991 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:37,006 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:37,022 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-12-16 09:32:37,022 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:37,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:37,023 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:37,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-12-16 09:32:37,025 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:37,030 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:37,030 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-16 09:32:37,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:37,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:37,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:37,031 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-12-16 09:32:37,039 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:32:37,039 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:37,051 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:37,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2021-12-16 09:32:37,066 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:37,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:37,067 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:37,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-12-16 09:32:37,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:37,074 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:37,074 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-16 09:32:37,075 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:37,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:37,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:37,075 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-12-16 09:32:37,081 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:32:37,081 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:37,088 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:37,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2021-12-16 09:32:37,103 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:37,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:37,105 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:37,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-12-16 09:32:37,107 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:37,113 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:37,113 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-16 09:32:37,113 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:37,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:37,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:37,113 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-12-16 09:32:37,115 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:32:37,115 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:37,117 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:37,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2021-12-16 09:32:37,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:37,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 09:32:37,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-16 09:32:37,135 INFO L87 Difference]: Start difference. First operand 246 states and 359 transitions. cyclomatic complexity: 120 Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:37,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:37,218 INFO L93 Difference]: Finished difference Result 485 states and 689 transitions. [2021-12-16 09:32:37,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 09:32:37,219 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 485 states and 689 transitions. [2021-12-16 09:32:37,223 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 337 [2021-12-16 09:32:37,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 485 states to 485 states and 689 transitions. [2021-12-16 09:32:37,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 485 [2021-12-16 09:32:37,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 485 [2021-12-16 09:32:37,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 485 states and 689 transitions. [2021-12-16 09:32:37,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:37,226 INFO L681 BuchiCegarLoop]: Abstraction has 485 states and 689 transitions. [2021-12-16 09:32:37,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states and 689 transitions. [2021-12-16 09:32:37,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 443. [2021-12-16 09:32:37,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 443 states have (on average 1.4311512415349887) internal successors, (634), 442 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:37,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 634 transitions. [2021-12-16 09:32:37,238 INFO L704 BuchiCegarLoop]: Abstraction has 443 states and 634 transitions. [2021-12-16 09:32:37,238 INFO L587 BuchiCegarLoop]: Abstraction has 443 states and 634 transitions. [2021-12-16 09:32:37,238 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-16 09:32:37,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 443 states and 634 transitions. [2021-12-16 09:32:37,240 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 296 [2021-12-16 09:32:37,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:37,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:37,241 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:37,241 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:37,241 INFO L791 eck$LassoCheckResult]: Stem: 2443#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 2430#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 2418#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 2420#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 2422#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 2423#L59-1 mp_add_~nb~0#1 := 4; 2438#L69 assume !(0 == mp_add_~b3~0#1 % 256); 2439#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 2461#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 2457#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 2440#L84 [2021-12-16 09:32:37,242 INFO L793 eck$LassoCheckResult]: Loop: 2440#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 2441#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 2825#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 2824#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 2823#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 2822#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 2820#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 2821#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 2789#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 2788#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 2779#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 2758#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 2759#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 2771#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 2768#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 2769#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 2799#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 2440#L84 [2021-12-16 09:32:37,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:37,242 INFO L85 PathProgramCache]: Analyzing trace with hash -2147194379, now seen corresponding path program 2 times [2021-12-16 09:32:37,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:37,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764729913] [2021-12-16 09:32:37,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:37,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:37,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:37,252 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:32:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:37,262 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:32:37,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:37,263 INFO L85 PathProgramCache]: Analyzing trace with hash 113218786, now seen corresponding path program 1 times [2021-12-16 09:32:37,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:37,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338077086] [2021-12-16 09:32:37,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:37,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:37,269 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:32:37,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:37,274 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:32:37,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:37,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1074123118, now seen corresponding path program 1 times [2021-12-16 09:32:37,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:37,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207165992] [2021-12-16 09:32:37,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:37,275 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:37,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:37,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:37,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207165992] [2021-12-16 09:32:37,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207165992] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:32:37,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295757325] [2021-12-16 09:32:37,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:37,396 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:32:37,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:37,400 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:32:37,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2021-12-16 09:32:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:37,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-16 09:32:37,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:32:39,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:39,001 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 09:32:39,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295757325] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:39,001 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 09:32:39,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2021-12-16 09:32:39,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725539968] [2021-12-16 09:32:39,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:39,103 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:32:39,103 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:32:39,103 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:32:39,103 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:32:39,103 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-16 09:32:39,103 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:39,103 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:32:39,103 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:32:39,103 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration7_Loop [2021-12-16 09:32:39,103 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:32:39,103 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:32:39,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:32:39,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:32:39,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:32:39,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:32:39,383 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:32:39,384 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-16 09:32:39,384 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:39,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:39,391 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-12-16 09:32:39,396 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:32:39,397 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:32:39,411 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-12-16 09:32:39,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2021-12-16 09:32:39,451 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:39,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:39,452 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:39,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-12-16 09:32:39,454 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-16 09:32:39,454 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:32:39,746 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-16 09:32:39,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2021-12-16 09:32:39,751 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:32:39,751 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:32:39,751 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:32:39,751 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:32:39,751 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:32:39,751 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:39,751 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:32:39,751 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:32:39,751 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration7_Loop [2021-12-16 09:32:39,751 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:32:39,751 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:32:39,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:32:39,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:32:39,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:32:39,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:32:40,006 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:32:40,006 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:32:40,006 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:40,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:40,008 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:40,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-12-16 09:32:40,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:40,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:32:40,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:40,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:40,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:40,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:32:40,036 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:32:40,036 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:40,037 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:40,052 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-12-16 09:32:40,052 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:40,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:40,053 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:40,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-12-16 09:32:40,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:40,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:32:40,061 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:40,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:40,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:40,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:32:40,064 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:32:40,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:40,067 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:40,082 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-12-16 09:32:40,083 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:40,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:40,084 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:40,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-12-16 09:32:40,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:40,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:32:40,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:40,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:40,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:40,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:32:40,094 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:32:40,094 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:40,097 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:40,113 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-12-16 09:32:40,113 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:40,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:40,114 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:40,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-12-16 09:32:40,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:40,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:32:40,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:40,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:40,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:40,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:32:40,124 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:32:40,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:40,125 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:40,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2021-12-16 09:32:40,140 INFO L490 LassoAnalysis]: Using template '2-nested'. [2021-12-16 09:32:40,140 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:40,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:40,141 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:40,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2021-12-16 09:32:40,143 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:40,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:32:40,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:40,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:40,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:40,150 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-16 09:32:40,150 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-16 09:32:40,150 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:40,151 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:40,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2021-12-16 09:32:40,167 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:40,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:40,168 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:40,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2021-12-16 09:32:40,170 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:40,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:32:40,177 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:40,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:40,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:40,177 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-16 09:32:40,182 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-16 09:32:40,182 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:40,191 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:40,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2021-12-16 09:32:40,207 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:40,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:40,208 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:40,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-12-16 09:32:40,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:40,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:32:40,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:40,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:40,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:40,217 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-16 09:32:40,220 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-16 09:32:40,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:40,224 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:40,239 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-12-16 09:32:40,239 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:40,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:40,240 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:40,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2021-12-16 09:32:40,243 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:40,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:32:40,249 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:40,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:40,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:40,249 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-16 09:32:40,250 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-16 09:32:40,250 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:40,251 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:40,266 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-12-16 09:32:40,266 INFO L490 LassoAnalysis]: Using template '3-nested'. [2021-12-16 09:32:40,266 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:40,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:40,267 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:40,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2021-12-16 09:32:40,275 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:40,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:32:40,282 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:40,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:40,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:40,282 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:32:40,282 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:32:40,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:40,284 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:40,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2021-12-16 09:32:40,299 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:40,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:40,300 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:40,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-12-16 09:32:40,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:32:40,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:40,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:40,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:40,316 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:32:40,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2021-12-16 09:32:40,319 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:32:40,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:40,324 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:40,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2021-12-16 09:32:40,339 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:40,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:40,340 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:40,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2021-12-16 09:32:40,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:40,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:32:40,349 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:40,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:40,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:40,349 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:32:40,353 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:32:40,353 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:40,358 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:40,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2021-12-16 09:32:40,374 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:40,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:40,375 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:40,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2021-12-16 09:32:40,377 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:40,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:32:40,383 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:40,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:40,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:40,383 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:32:40,383 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:32:40,384 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:40,391 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:40,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2021-12-16 09:32:40,406 INFO L490 LassoAnalysis]: Using template '4-nested'. [2021-12-16 09:32:40,407 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:40,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:40,408 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:40,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2021-12-16 09:32:40,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:40,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:32:40,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:40,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:40,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:40,421 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-16 09:32:40,421 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-16 09:32:40,421 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:40,422 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:40,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2021-12-16 09:32:40,437 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:40,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:40,438 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:40,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2021-12-16 09:32:40,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:40,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:32:40,447 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:40,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:40,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:40,447 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-16 09:32:40,451 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-16 09:32:40,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:40,479 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:40,494 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-12-16 09:32:40,495 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:40,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:40,496 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:40,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2021-12-16 09:32:40,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:40,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:32:40,507 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:40,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:40,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:40,508 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-16 09:32:40,515 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-16 09:32:40,515 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:40,521 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:40,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2021-12-16 09:32:40,536 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:40,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:40,537 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:40,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2021-12-16 09:32:40,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:40,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:32:40,545 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:40,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:40,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:40,546 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-16 09:32:40,546 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-16 09:32:40,546 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:40,548 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:40,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2021-12-16 09:32:40,563 INFO L490 LassoAnalysis]: Using template '2-phase'. [2021-12-16 09:32:40,563 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:40,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:40,564 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:40,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2021-12-16 09:32:40,566 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:40,571 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:40,572 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-16 09:32:40,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:40,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:40,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:40,572 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-16 09:32:40,573 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-16 09:32:40,573 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:40,583 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:40,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2021-12-16 09:32:40,598 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:40,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:40,598 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:40,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2021-12-16 09:32:40,601 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:40,607 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:40,607 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-16 09:32:40,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:40,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:40,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:40,607 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-16 09:32:40,612 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-16 09:32:40,612 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:40,643 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:40,665 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-12-16 09:32:40,666 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:40,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:40,667 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:40,671 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:40,679 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:40,679 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-16 09:32:40,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:40,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:40,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:40,679 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-16 09:32:40,684 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-16 09:32:40,684 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:40,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2021-12-16 09:32:40,699 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:40,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2021-12-16 09:32:40,720 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:40,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:40,721 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:40,723 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:40,730 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:40,730 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-16 09:32:40,730 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:40,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:40,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:40,730 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-16 09:32:40,731 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-16 09:32:40,731 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:40,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2021-12-16 09:32:40,743 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:40,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2021-12-16 09:32:40,763 INFO L490 LassoAnalysis]: Using template '3-phase'. [2021-12-16 09:32:40,763 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:40,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:40,764 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:40,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2021-12-16 09:32:40,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:40,779 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:40,780 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-12-16 09:32:40,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:40,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:40,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:40,780 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:32:40,781 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:32:40,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:40,795 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:40,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2021-12-16 09:32:40,817 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:40,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:40,818 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:40,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2021-12-16 09:32:40,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:40,828 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:40,828 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-12-16 09:32:40,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:40,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:40,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:40,829 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:32:40,835 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:32:40,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:40,863 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:40,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2021-12-16 09:32:40,887 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:40,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:40,888 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:40,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:40,899 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:40,899 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-12-16 09:32:40,899 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:40,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:40,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:40,899 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:32:40,905 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:32:40,905 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:40,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2021-12-16 09:32:40,919 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:40,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2021-12-16 09:32:40,942 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:40,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:40,943 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:40,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:40,955 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:40,955 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-12-16 09:32:40,956 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:40,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:40,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:40,956 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:32:40,957 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:32:40,957 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:40,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2021-12-16 09:32:40,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:40,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2021-12-16 09:32:40,990 INFO L490 LassoAnalysis]: Using template '4-phase'. [2021-12-16 09:32:40,990 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:40,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:40,991 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:40,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-12-16 09:32:41,004 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:41,004 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-16 09:32:41,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:41,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:41,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:41,004 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-16 09:32:41,005 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-16 09:32:41,005 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:41,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2021-12-16 09:32:41,019 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:41,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2021-12-16 09:32:41,042 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:41,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:41,043 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:41,047 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:41,056 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:41,056 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-16 09:32:41,056 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:41,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:41,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:41,056 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-16 09:32:41,063 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-16 09:32:41,063 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:41,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2021-12-16 09:32:41,080 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:41,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2021-12-16 09:32:41,095 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:41,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:41,096 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:41,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2021-12-16 09:32:41,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:41,105 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:41,105 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-16 09:32:41,105 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:41,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:41,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:41,106 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-16 09:32:41,113 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-16 09:32:41,113 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:41,147 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:41,169 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-12-16 09:32:41,170 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:41,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:41,171 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:41,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:41,183 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:41,183 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-16 09:32:41,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:41,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:41,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:41,184 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-16 09:32:41,185 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-16 09:32:41,185 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:41,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2021-12-16 09:32:41,199 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:41,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2021-12-16 09:32:41,220 INFO L490 LassoAnalysis]: Using template '2-lex'. [2021-12-16 09:32:41,220 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:41,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:41,221 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:41,227 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:41,235 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:41,235 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-16 09:32:41,235 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:41,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:41,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:41,235 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:32:41,236 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:32:41,236 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:41,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2021-12-16 09:32:41,247 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:41,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2021-12-16 09:32:41,268 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:41,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:41,269 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:41,275 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:41,283 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:41,283 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-16 09:32:41,283 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:41,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:41,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:41,283 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:32:41,289 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:32:41,289 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:41,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2021-12-16 09:32:41,300 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:41,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2021-12-16 09:32:41,321 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:41,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:41,322 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:41,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2021-12-16 09:32:41,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-12-16 09:32:41,332 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:41,332 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-16 09:32:41,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:41,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:41,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:41,332 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:32:41,337 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:32:41,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:41,355 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:41,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2021-12-16 09:32:41,376 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:41,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:41,377 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:41,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-12-16 09:32:41,387 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:41,387 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-16 09:32:41,387 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:41,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:41,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:41,387 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:32:41,388 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:32:41,388 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:41,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2021-12-16 09:32:41,399 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:41,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2021-12-16 09:32:41,421 INFO L490 LassoAnalysis]: Using template '3-lex'. [2021-12-16 09:32:41,421 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:41,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:41,422 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:41,427 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:41,435 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:41,436 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-16 09:32:41,436 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:41,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:41,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:41,436 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-12-16 09:32:41,437 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:32:41,437 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:41,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2021-12-16 09:32:41,451 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:41,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2021-12-16 09:32:41,474 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:41,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:41,475 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:41,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2021-12-16 09:32:41,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-12-16 09:32:41,486 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:41,486 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-16 09:32:41,486 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:41,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:41,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:41,486 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-12-16 09:32:41,492 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:32:41,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:41,515 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:41,538 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-12-16 09:32:41,539 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:41,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:41,540 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:41,548 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:41,556 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:41,556 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-16 09:32:41,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:41,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:41,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:41,556 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-12-16 09:32:41,564 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:32:41,565 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:41,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2021-12-16 09:32:41,579 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:41,602 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-12-16 09:32:41,603 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:32:41,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:41,604 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:32:41,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2021-12-16 09:32:41,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:32:41,613 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:32:41,614 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-16 09:32:41,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:32:41,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:32:41,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:32:41,614 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-12-16 09:32:41,615 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:32:41,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:32:41,630 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:32:41,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2021-12-16 09:32:41,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:41,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 09:32:41,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-12-16 09:32:41,654 INFO L87 Difference]: Start difference. First operand 443 states and 634 transitions. cyclomatic complexity: 202 Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:41,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:41,685 INFO L93 Difference]: Finished difference Result 486 states and 686 transitions. [2021-12-16 09:32:41,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 09:32:41,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 486 states and 686 transitions. [2021-12-16 09:32:41,691 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 305 [2021-12-16 09:32:41,693 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 486 states to 486 states and 686 transitions. [2021-12-16 09:32:41,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 486 [2021-12-16 09:32:41,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 486 [2021-12-16 09:32:41,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 486 states and 686 transitions. [2021-12-16 09:32:41,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:41,695 INFO L681 BuchiCegarLoop]: Abstraction has 486 states and 686 transitions. [2021-12-16 09:32:41,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states and 686 transitions. [2021-12-16 09:32:41,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 477. [2021-12-16 09:32:41,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 477 states have (on average 1.4109014675052411) internal successors, (673), 476 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:41,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 673 transitions. [2021-12-16 09:32:41,704 INFO L704 BuchiCegarLoop]: Abstraction has 477 states and 673 transitions. [2021-12-16 09:32:41,704 INFO L587 BuchiCegarLoop]: Abstraction has 477 states and 673 transitions. [2021-12-16 09:32:41,704 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-16 09:32:41,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 477 states and 673 transitions. [2021-12-16 09:32:41,706 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 296 [2021-12-16 09:32:41,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:41,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:41,707 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:41,707 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:41,708 INFO L791 eck$LassoCheckResult]: Stem: 3468#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 3455#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 3443#L59 assume !(0 == mp_add_~a3~0#1 % 256); 3444#L59-1 mp_add_~nb~0#1 := 4; 3462#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 3464#L71 assume !(0 == mp_add_~b2~0#1 % 256); 3766#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 3765#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 3764#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 3763#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 3762#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 3761#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 3760#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 3757#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 3759#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 3825#L95-1 [2021-12-16 09:32:41,708 INFO L793 eck$LassoCheckResult]: Loop: 3825#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 3819#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 3816#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 3814#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 3811#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 3812#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 3803#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 3804#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 3836#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 3835#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 3834#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 3832#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 3824#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 3825#L95-1 [2021-12-16 09:32:41,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:41,708 INFO L85 PathProgramCache]: Analyzing trace with hash -2095675795, now seen corresponding path program 1 times [2021-12-16 09:32:41,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:41,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214155316] [2021-12-16 09:32:41,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:41,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:41,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:41,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:41,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214155316] [2021-12-16 09:32:41,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214155316] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:41,744 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:41,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 09:32:41,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714762320] [2021-12-16 09:32:41,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:41,745 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:32:41,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:41,746 INFO L85 PathProgramCache]: Analyzing trace with hash 686981138, now seen corresponding path program 6 times [2021-12-16 09:32:41,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:41,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280664346] [2021-12-16 09:32:41,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:41,746 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:41,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:41,804 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:41,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280664346] [2021-12-16 09:32:41,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280664346] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:41,804 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:41,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 09:32:41,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797606032] [2021-12-16 09:32:41,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:41,805 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:41,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:41,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 09:32:41,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 09:32:41,806 INFO L87 Difference]: Start difference. First operand 477 states and 673 transitions. cyclomatic complexity: 207 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-12-16 09:32:41,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:41,909 INFO L93 Difference]: Finished difference Result 689 states and 1005 transitions. [2021-12-16 09:32:41,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 09:32:41,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 689 states and 1005 transitions. [2021-12-16 09:32:41,918 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 506 [2021-12-16 09:32:41,921 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 689 states to 687 states and 1003 transitions. [2021-12-16 09:32:41,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 687 [2021-12-16 09:32:41,922 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 687 [2021-12-16 09:32:41,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 687 states and 1003 transitions. [2021-12-16 09:32:41,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:41,923 INFO L681 BuchiCegarLoop]: Abstraction has 687 states and 1003 transitions. [2021-12-16 09:32:41,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states and 1003 transitions. [2021-12-16 09:32:41,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 593. [2021-12-16 09:32:41,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 593 states have (on average 1.4569983136593592) internal successors, (864), 592 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:41,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 864 transitions. [2021-12-16 09:32:41,933 INFO L704 BuchiCegarLoop]: Abstraction has 593 states and 864 transitions. [2021-12-16 09:32:41,933 INFO L587 BuchiCegarLoop]: Abstraction has 593 states and 864 transitions. [2021-12-16 09:32:41,934 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-16 09:32:41,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 593 states and 864 transitions. [2021-12-16 09:32:41,936 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 446 [2021-12-16 09:32:41,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:41,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:41,937 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:41,937 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:41,938 INFO L791 eck$LassoCheckResult]: Stem: 4643#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 4629#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 4617#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 4619#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 4621#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 4622#L59-1 mp_add_~nb~0#1 := 4; 4634#L69 assume !(0 == mp_add_~b3~0#1 % 256); 4663#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 4644#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4645#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 5186#L84 [2021-12-16 09:32:41,938 INFO L793 eck$LassoCheckResult]: Loop: 5186#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 4662#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 4646#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 4647#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 4665#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 4654#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 4655#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 4615#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 4616#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 4613#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 4614#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 5062#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 5061#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 5059#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 5060#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 5200#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4658#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 4659#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 5193#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 4664#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 4635#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 4624#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 4625#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 4651#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 4693#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4694#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 5186#L84 [2021-12-16 09:32:41,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:41,938 INFO L85 PathProgramCache]: Analyzing trace with hash -2147194379, now seen corresponding path program 3 times [2021-12-16 09:32:41,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:41,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438501108] [2021-12-16 09:32:41,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:41,939 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:41,963 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:32:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:41,977 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:32:41,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:41,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1272887899, now seen corresponding path program 1 times [2021-12-16 09:32:41,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:41,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362748520] [2021-12-16 09:32:41,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:41,978 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:41,993 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-16 09:32:41,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:41,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362748520] [2021-12-16 09:32:41,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362748520] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:41,994 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:41,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 09:32:41,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154794293] [2021-12-16 09:32:41,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:41,995 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:41,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:41,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 09:32:41,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 09:32:41,996 INFO L87 Difference]: Start difference. First operand 593 states and 864 transitions. cyclomatic complexity: 282 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:42,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:42,066 INFO L93 Difference]: Finished difference Result 757 states and 1089 transitions. [2021-12-16 09:32:42,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 09:32:42,067 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 757 states and 1089 transitions. [2021-12-16 09:32:42,071 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 608 [2021-12-16 09:32:42,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 757 states to 757 states and 1089 transitions. [2021-12-16 09:32:42,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 757 [2021-12-16 09:32:42,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 757 [2021-12-16 09:32:42,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 757 states and 1089 transitions. [2021-12-16 09:32:42,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:42,077 INFO L681 BuchiCegarLoop]: Abstraction has 757 states and 1089 transitions. [2021-12-16 09:32:42,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states and 1089 transitions. [2021-12-16 09:32:42,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 685. [2021-12-16 09:32:42,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 685 states have (on average 1.4525547445255473) internal successors, (995), 684 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:42,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 995 transitions. [2021-12-16 09:32:42,088 INFO L704 BuchiCegarLoop]: Abstraction has 685 states and 995 transitions. [2021-12-16 09:32:42,088 INFO L587 BuchiCegarLoop]: Abstraction has 685 states and 995 transitions. [2021-12-16 09:32:42,088 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-16 09:32:42,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 685 states and 995 transitions. [2021-12-16 09:32:42,091 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 538 [2021-12-16 09:32:42,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:42,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:42,092 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:42,092 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:42,092 INFO L791 eck$LassoCheckResult]: Stem: 5998#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 5985#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 5969#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 5971#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 5973#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 5974#L59-1 mp_add_~nb~0#1 := 4; 6286#L69 assume !(0 == mp_add_~b3~0#1 % 256); 6017#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 6018#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6015#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 5996#L84 [2021-12-16 09:32:42,092 INFO L793 eck$LassoCheckResult]: Loop: 5996#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 5997#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 6650#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 6649#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 6648#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 6009#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 6010#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 6020#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 6606#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 6607#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 6642#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 6626#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 6641#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 6640#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 6639#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 6638#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6637#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 6635#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 6633#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 6624#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 6623#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 5992#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 6007#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 6008#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 6028#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6029#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 5996#L84 [2021-12-16 09:32:42,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:42,093 INFO L85 PathProgramCache]: Analyzing trace with hash -2147194379, now seen corresponding path program 4 times [2021-12-16 09:32:42,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:42,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457182223] [2021-12-16 09:32:42,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:42,094 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:42,101 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:32:42,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:42,109 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:32:42,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:42,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1270981275, now seen corresponding path program 1 times [2021-12-16 09:32:42,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:42,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539025983] [2021-12-16 09:32:42,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:42,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:42,144 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:42,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:42,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539025983] [2021-12-16 09:32:42,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539025983] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:42,145 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:42,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 09:32:42,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214321555] [2021-12-16 09:32:42,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:42,146 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:42,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:42,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 09:32:42,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 09:32:42,147 INFO L87 Difference]: Start difference. First operand 685 states and 995 transitions. cyclomatic complexity: 320 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-12-16 09:32:42,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:42,200 INFO L93 Difference]: Finished difference Result 1201 states and 1771 transitions. [2021-12-16 09:32:42,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 09:32:42,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1201 states and 1771 transitions. [2021-12-16 09:32:42,208 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1054 [2021-12-16 09:32:42,213 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1201 states to 1201 states and 1771 transitions. [2021-12-16 09:32:42,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1201 [2021-12-16 09:32:42,215 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1201 [2021-12-16 09:32:42,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1201 states and 1771 transitions. [2021-12-16 09:32:42,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:42,217 INFO L681 BuchiCegarLoop]: Abstraction has 1201 states and 1771 transitions. [2021-12-16 09:32:42,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states and 1771 transitions. [2021-12-16 09:32:42,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 1045. [2021-12-16 09:32:42,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 1045 states have (on average 1.4822966507177033) internal successors, (1549), 1044 states have internal predecessors, (1549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:42,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1549 transitions. [2021-12-16 09:32:42,250 INFO L704 BuchiCegarLoop]: Abstraction has 1045 states and 1549 transitions. [2021-12-16 09:32:42,250 INFO L587 BuchiCegarLoop]: Abstraction has 1045 states and 1549 transitions. [2021-12-16 09:32:42,251 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-16 09:32:42,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1045 states and 1549 transitions. [2021-12-16 09:32:42,255 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 898 [2021-12-16 09:32:42,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:42,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:42,256 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:42,256 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:42,256 INFO L791 eck$LassoCheckResult]: Stem: 7892#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 7880#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 7862#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 7864#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 7866#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 7867#L59-1 mp_add_~nb~0#1 := 4; 8300#L69 assume !(0 == mp_add_~b3~0#1 % 256); 7911#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 7895#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 7896#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 7908#L84 [2021-12-16 09:32:42,257 INFO L793 eck$LassoCheckResult]: Loop: 7908#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 8903#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 8901#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 8900#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 8898#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 8290#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 8291#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 8285#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 8286#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 8272#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 8273#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 8266#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 8262#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 8259#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 8256#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 7927#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 7928#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 8890#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 7874#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 8887#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 8885#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 8883#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 8881#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 8879#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 8876#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 8877#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 7908#L84 [2021-12-16 09:32:42,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:42,257 INFO L85 PathProgramCache]: Analyzing trace with hash -2147194379, now seen corresponding path program 5 times [2021-12-16 09:32:42,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:42,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641483812] [2021-12-16 09:32:42,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:42,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:42,266 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:32:42,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:42,284 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:32:42,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:42,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1490989797, now seen corresponding path program 1 times [2021-12-16 09:32:42,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:42,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899646748] [2021-12-16 09:32:42,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:42,286 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:42,302 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-16 09:32:42,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:42,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899646748] [2021-12-16 09:32:42,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899646748] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:42,303 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:42,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 09:32:42,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584725433] [2021-12-16 09:32:42,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:42,304 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:42,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:42,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 09:32:42,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 09:32:42,305 INFO L87 Difference]: Start difference. First operand 1045 states and 1549 transitions. cyclomatic complexity: 514 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:42,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:42,376 INFO L93 Difference]: Finished difference Result 1270 states and 1888 transitions. [2021-12-16 09:32:42,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 09:32:42,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1270 states and 1888 transitions. [2021-12-16 09:32:42,385 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 1121 [2021-12-16 09:32:42,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1270 states to 1270 states and 1888 transitions. [2021-12-16 09:32:42,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1270 [2021-12-16 09:32:42,394 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1270 [2021-12-16 09:32:42,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1270 states and 1888 transitions. [2021-12-16 09:32:42,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:42,396 INFO L681 BuchiCegarLoop]: Abstraction has 1270 states and 1888 transitions. [2021-12-16 09:32:42,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states and 1888 transitions. [2021-12-16 09:32:42,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1123. [2021-12-16 09:32:42,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 1123 states have (on average 1.5004452359750668) internal successors, (1685), 1122 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:42,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1685 transitions. [2021-12-16 09:32:42,414 INFO L704 BuchiCegarLoop]: Abstraction has 1123 states and 1685 transitions. [2021-12-16 09:32:42,415 INFO L587 BuchiCegarLoop]: Abstraction has 1123 states and 1685 transitions. [2021-12-16 09:32:42,415 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-16 09:32:42,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1123 states and 1685 transitions. [2021-12-16 09:32:42,420 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 976 [2021-12-16 09:32:42,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:42,420 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:42,421 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:42,421 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:42,421 INFO L791 eck$LassoCheckResult]: Stem: 10213#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 10201#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 10183#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 10185#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 10187#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 10188#L59-1 mp_add_~nb~0#1 := 4; 10665#L69 assume !(0 == mp_add_~b3~0#1 % 256); 10231#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 10232#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 11182#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 10283#L84 [2021-12-16 09:32:42,421 INFO L793 eck$LassoCheckResult]: Loop: 10283#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 11181#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 11180#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 11179#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 11178#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 11177#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 11046#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 11119#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 11117#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 11118#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 11168#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 11167#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 11166#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 11165#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 11164#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 11056#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 10611#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 10612#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 10599#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 10600#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 10693#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 11185#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 11184#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 10583#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 10584#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 10605#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 10283#L84 [2021-12-16 09:32:42,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:42,422 INFO L85 PathProgramCache]: Analyzing trace with hash -2147194379, now seen corresponding path program 6 times [2021-12-16 09:32:42,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:42,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775862747] [2021-12-16 09:32:42,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:42,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:42,435 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:32:42,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:42,449 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:32:42,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:42,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1491049379, now seen corresponding path program 1 times [2021-12-16 09:32:42,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:42,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649973255] [2021-12-16 09:32:42,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:42,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:42,534 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:42,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:42,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649973255] [2021-12-16 09:32:42,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649973255] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:32:42,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726394801] [2021-12-16 09:32:42,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:42,535 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:32:42,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:42,536 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:32:42,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2021-12-16 09:32:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:42,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-16 09:32:42,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:32:42,704 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:42,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:32:42,770 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:42,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726394801] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:32:42,771 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:32:42,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2021-12-16 09:32:42,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769186542] [2021-12-16 09:32:42,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:32:42,772 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:42,772 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:42,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 09:32:42,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-16 09:32:42,772 INFO L87 Difference]: Start difference. First operand 1123 states and 1685 transitions. cyclomatic complexity: 571 Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:43,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:43,037 INFO L93 Difference]: Finished difference Result 1709 states and 2417 transitions. [2021-12-16 09:32:43,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 09:32:43,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1709 states and 2417 transitions. [2021-12-16 09:32:43,047 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1490 [2021-12-16 09:32:43,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1709 states to 1709 states and 2417 transitions. [2021-12-16 09:32:43,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1709 [2021-12-16 09:32:43,056 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1709 [2021-12-16 09:32:43,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1709 states and 2417 transitions. [2021-12-16 09:32:43,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:43,058 INFO L681 BuchiCegarLoop]: Abstraction has 1709 states and 2417 transitions. [2021-12-16 09:32:43,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1709 states and 2417 transitions. [2021-12-16 09:32:43,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1709 to 1534. [2021-12-16 09:32:43,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1534 states, 1534 states have (on average 1.4491525423728813) internal successors, (2223), 1533 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:43,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1534 states and 2223 transitions. [2021-12-16 09:32:43,083 INFO L704 BuchiCegarLoop]: Abstraction has 1534 states and 2223 transitions. [2021-12-16 09:32:43,083 INFO L587 BuchiCegarLoop]: Abstraction has 1534 states and 2223 transitions. [2021-12-16 09:32:43,083 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-12-16 09:32:43,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1534 states and 2223 transitions. [2021-12-16 09:32:43,089 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1385 [2021-12-16 09:32:43,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:43,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:43,090 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:43,090 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:43,090 INFO L791 eck$LassoCheckResult]: Stem: 13214#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 13199#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 13187#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 13189#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 13191#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 13192#L59-1 mp_add_~nb~0#1 := 4; 13936#L69 assume !(0 == mp_add_~b3~0#1 % 256); 13937#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 14009#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 14008#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 13380#L84 [2021-12-16 09:32:43,090 INFO L793 eck$LassoCheckResult]: Loop: 13380#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 14007#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 14006#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 14002#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 13997#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 13988#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 13558#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 13987#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 13912#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 13908#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 13909#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 13911#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 13896#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 13895#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 13893#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 13894#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 13889#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 13890#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 13823#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 13824#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 13529#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 13530#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 13448#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 13392#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 13393#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 13379#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 13380#L84 [2021-12-16 09:32:43,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:43,091 INFO L85 PathProgramCache]: Analyzing trace with hash -2147194379, now seen corresponding path program 7 times [2021-12-16 09:32:43,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:43,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751844857] [2021-12-16 09:32:43,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:43,091 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:43,098 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:32:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:43,105 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:32:43,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:43,105 INFO L85 PathProgramCache]: Analyzing trace with hash -2080327901, now seen corresponding path program 1 times [2021-12-16 09:32:43,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:43,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689173283] [2021-12-16 09:32:43,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:43,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:43,168 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:43,169 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:43,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689173283] [2021-12-16 09:32:43,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689173283] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:43,169 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:43,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 09:32:43,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156381906] [2021-12-16 09:32:43,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:43,170 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:43,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:43,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 09:32:43,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 09:32:43,171 INFO L87 Difference]: Start difference. First operand 1534 states and 2223 transitions. cyclomatic complexity: 698 Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:43,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:43,398 INFO L93 Difference]: Finished difference Result 2729 states and 3809 transitions. [2021-12-16 09:32:43,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 09:32:43,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2729 states and 3809 transitions. [2021-12-16 09:32:43,412 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 2551 [2021-12-16 09:32:43,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2729 states to 2729 states and 3809 transitions. [2021-12-16 09:32:43,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2729 [2021-12-16 09:32:43,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2729 [2021-12-16 09:32:43,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2729 states and 3809 transitions. [2021-12-16 09:32:43,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:43,430 INFO L681 BuchiCegarLoop]: Abstraction has 2729 states and 3809 transitions. [2021-12-16 09:32:43,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2729 states and 3809 transitions. [2021-12-16 09:32:43,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2729 to 2080. [2021-12-16 09:32:43,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2080 states, 2080 states have (on average 1.40625) internal successors, (2925), 2079 states have internal predecessors, (2925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:43,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2080 states to 2080 states and 2925 transitions. [2021-12-16 09:32:43,465 INFO L704 BuchiCegarLoop]: Abstraction has 2080 states and 2925 transitions. [2021-12-16 09:32:43,465 INFO L587 BuchiCegarLoop]: Abstraction has 2080 states and 2925 transitions. [2021-12-16 09:32:43,465 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-12-16 09:32:43,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2080 states and 2925 transitions. [2021-12-16 09:32:43,473 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 1919 [2021-12-16 09:32:43,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:43,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:43,474 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:43,474 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:43,474 INFO L791 eck$LassoCheckResult]: Stem: 17484#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 17471#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 17459#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 17461#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 17463#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 17464#L59-1 mp_add_~nb~0#1 := 4; 17479#L69 assume !(0 == mp_add_~b3~0#1 % 256); 17480#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 17505#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 18994#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 18995#L84 [2021-12-16 09:32:43,475 INFO L793 eck$LassoCheckResult]: Loop: 18995#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 17503#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 17504#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 17472#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 17473#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 19475#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 19474#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 19473#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 19472#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 19471#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 19469#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 19467#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 19465#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 19463#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 19461#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 19458#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 19459#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 19411#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 19412#L90 assume !(0 == mp_add_~i~0#1 % 256); 19448#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 17507#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 19513#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 19511#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 19499#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 19498#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 19497#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 19496#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 19075#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 17530#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 17531#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 18995#L84 [2021-12-16 09:32:43,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:43,475 INFO L85 PathProgramCache]: Analyzing trace with hash -2147194379, now seen corresponding path program 8 times [2021-12-16 09:32:43,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:43,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889984541] [2021-12-16 09:32:43,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:43,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:43,481 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:32:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:43,488 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:32:43,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:43,489 INFO L85 PathProgramCache]: Analyzing trace with hash 494018515, now seen corresponding path program 1 times [2021-12-16 09:32:43,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:43,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363523512] [2021-12-16 09:32:43,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:43,490 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:43,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:43,573 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:43,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:43,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363523512] [2021-12-16 09:32:43,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363523512] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:32:43,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190325575] [2021-12-16 09:32:43,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:43,574 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:32:43,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:43,579 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:32:43,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2021-12-16 09:32:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:43,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-16 09:32:43,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:32:43,727 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:43,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:32:43,797 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:43,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190325575] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:32:43,798 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:32:43,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2021-12-16 09:32:43,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471139416] [2021-12-16 09:32:43,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:32:43,799 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:43,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:43,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 09:32:43,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-16 09:32:43,799 INFO L87 Difference]: Start difference. First operand 2080 states and 2925 transitions. cyclomatic complexity: 855 Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:44,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:44,045 INFO L93 Difference]: Finished difference Result 2367 states and 3261 transitions. [2021-12-16 09:32:44,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 09:32:44,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2367 states and 3261 transitions. [2021-12-16 09:32:44,066 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 2136 [2021-12-16 09:32:44,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2367 states to 2367 states and 3261 transitions. [2021-12-16 09:32:44,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2367 [2021-12-16 09:32:44,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2367 [2021-12-16 09:32:44,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2367 states and 3261 transitions. [2021-12-16 09:32:44,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:44,080 INFO L681 BuchiCegarLoop]: Abstraction has 2367 states and 3261 transitions. [2021-12-16 09:32:44,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states and 3261 transitions. [2021-12-16 09:32:44,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 2176. [2021-12-16 09:32:44,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2176 states, 2176 states have (on average 1.4021139705882353) internal successors, (3051), 2175 states have internal predecessors, (3051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:44,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 3051 transitions. [2021-12-16 09:32:44,118 INFO L704 BuchiCegarLoop]: Abstraction has 2176 states and 3051 transitions. [2021-12-16 09:32:44,118 INFO L587 BuchiCegarLoop]: Abstraction has 2176 states and 3051 transitions. [2021-12-16 09:32:44,118 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-12-16 09:32:44,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2176 states and 3051 transitions. [2021-12-16 09:32:44,124 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 2015 [2021-12-16 09:32:44,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:44,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:44,125 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:44,125 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-12-16 09:32:44,126 INFO L791 eck$LassoCheckResult]: Stem: 22121#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 22107#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 22095#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 22097#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 22099#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 22100#L59-1 mp_add_~nb~0#1 := 4; 22112#L69 assume !(0 == mp_add_~b3~0#1 % 256); 22140#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 22141#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 23993#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 23469#L84 [2021-12-16 09:32:44,126 INFO L793 eck$LassoCheckResult]: Loop: 23469#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 22139#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 22124#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 22108#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 22109#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 22142#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 24262#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 24261#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 24260#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 24258#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 24257#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 24256#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 24255#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 24254#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 24253#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 22122#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 22123#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 24247#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 24094#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 24095#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 24223#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 22192#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 24010#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 24002#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 24003#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 24050#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 24051#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 24047#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 22210#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 22191#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 22193#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 22195#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 22184#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 22185#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 24067#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 23469#L84 [2021-12-16 09:32:44,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:44,126 INFO L85 PathProgramCache]: Analyzing trace with hash -2147194379, now seen corresponding path program 9 times [2021-12-16 09:32:44,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:44,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066700796] [2021-12-16 09:32:44,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:44,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:44,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:44,134 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:32:44,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:44,140 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:32:44,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:44,141 INFO L85 PathProgramCache]: Analyzing trace with hash 718868542, now seen corresponding path program 1 times [2021-12-16 09:32:44,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:44,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057009468] [2021-12-16 09:32:44,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:44,141 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:44,183 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:44,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:44,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057009468] [2021-12-16 09:32:44,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057009468] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:32:44,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245464067] [2021-12-16 09:32:44,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:44,184 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:32:44,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:44,187 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:32:44,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2021-12-16 09:32:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:44,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-16 09:32:44,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:32:44,313 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:44,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:32:44,436 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:44,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245464067] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:32:44,436 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:32:44,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2021-12-16 09:32:44,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805351308] [2021-12-16 09:32:44,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:32:44,437 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:44,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:44,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-16 09:32:44,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-12-16 09:32:44,438 INFO L87 Difference]: Start difference. First operand 2176 states and 3051 transitions. cyclomatic complexity: 885 Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:44,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:44,784 INFO L93 Difference]: Finished difference Result 2784 states and 3676 transitions. [2021-12-16 09:32:44,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 09:32:44,785 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2784 states and 3676 transitions. [2021-12-16 09:32:44,796 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 2605 [2021-12-16 09:32:44,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2784 states to 2784 states and 3676 transitions. [2021-12-16 09:32:44,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2784 [2021-12-16 09:32:44,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2784 [2021-12-16 09:32:44,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2784 states and 3676 transitions. [2021-12-16 09:32:44,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:44,813 INFO L681 BuchiCegarLoop]: Abstraction has 2784 states and 3676 transitions. [2021-12-16 09:32:44,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states and 3676 transitions. [2021-12-16 09:32:44,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 1906. [2021-12-16 09:32:44,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1906 states, 1906 states have (on average 1.3352570828961174) internal successors, (2545), 1905 states have internal predecessors, (2545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:44,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1906 states and 2545 transitions. [2021-12-16 09:32:44,848 INFO L704 BuchiCegarLoop]: Abstraction has 1906 states and 2545 transitions. [2021-12-16 09:32:44,848 INFO L587 BuchiCegarLoop]: Abstraction has 1906 states and 2545 transitions. [2021-12-16 09:32:44,848 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-12-16 09:32:44,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1906 states and 2545 transitions. [2021-12-16 09:32:44,852 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 1745 [2021-12-16 09:32:44,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:44,853 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:44,853 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:44,853 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-12-16 09:32:44,854 INFO L791 eck$LassoCheckResult]: Stem: 27310#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 27297#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 27285#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 27287#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 27289#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 27290#L59-1 mp_add_~nb~0#1 := 4; 27619#L69 assume !(0 == mp_add_~b3~0#1 % 256); 27620#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 27663#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 27662#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 27467#L84 [2021-12-16 09:32:44,854 INFO L793 eck$LassoCheckResult]: Loop: 27467#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 27651#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 27650#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 27649#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 27648#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 27647#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 27646#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 27601#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 27602#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 27645#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 27643#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 27641#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 27639#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 27637#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 27532#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 27533#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 27528#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 27529#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 27636#L90 assume !(0 == mp_add_~i~0#1 % 256); 27635#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 27550#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 27551#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 27629#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 27439#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 27440#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 27432#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 27433#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 27428#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 27429#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 27422#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 27423#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 27414#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 27415#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 27405#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 27407#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 27397#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 27398#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 27391#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 27392#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 27467#L84 [2021-12-16 09:32:44,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:44,854 INFO L85 PathProgramCache]: Analyzing trace with hash -2147194379, now seen corresponding path program 10 times [2021-12-16 09:32:44,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:44,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674418122] [2021-12-16 09:32:44,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:44,855 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:44,861 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:32:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:44,868 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:32:44,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:44,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1546138288, now seen corresponding path program 1 times [2021-12-16 09:32:44,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:44,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301021327] [2021-12-16 09:32:44,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:44,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:44,963 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-16 09:32:44,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:44,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301021327] [2021-12-16 09:32:44,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301021327] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:32:44,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782719912] [2021-12-16 09:32:44,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:44,964 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:32:44,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:44,971 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:32:44,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2021-12-16 09:32:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:45,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 09:32:45,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:32:45,137 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-16 09:32:45,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:32:45,217 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-16 09:32:45,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782719912] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:32:45,217 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:32:45,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 10 [2021-12-16 09:32:45,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984580657] [2021-12-16 09:32:45,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:32:45,218 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:45,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:45,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 09:32:45,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-12-16 09:32:45,219 INFO L87 Difference]: Start difference. First operand 1906 states and 2545 transitions. cyclomatic complexity: 649 Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:45,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:45,679 INFO L93 Difference]: Finished difference Result 2112 states and 2580 transitions. [2021-12-16 09:32:45,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-16 09:32:45,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2112 states and 2580 transitions. [2021-12-16 09:32:45,687 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1844 [2021-12-16 09:32:45,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2112 states to 2104 states and 2570 transitions. [2021-12-16 09:32:45,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2104 [2021-12-16 09:32:45,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2104 [2021-12-16 09:32:45,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2104 states and 2570 transitions. [2021-12-16 09:32:45,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:45,699 INFO L681 BuchiCegarLoop]: Abstraction has 2104 states and 2570 transitions. [2021-12-16 09:32:45,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2104 states and 2570 transitions. [2021-12-16 09:32:45,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2104 to 1357. [2021-12-16 09:32:45,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1357 states, 1357 states have (on average 1.2822402358142961) internal successors, (1740), 1356 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:45,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1740 transitions. [2021-12-16 09:32:45,731 INFO L704 BuchiCegarLoop]: Abstraction has 1357 states and 1740 transitions. [2021-12-16 09:32:45,731 INFO L587 BuchiCegarLoop]: Abstraction has 1357 states and 1740 transitions. [2021-12-16 09:32:45,731 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-12-16 09:32:45,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1357 states and 1740 transitions. [2021-12-16 09:32:45,734 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1203 [2021-12-16 09:32:45,734 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:45,734 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:45,735 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:45,735 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-12-16 09:32:45,736 INFO L791 eck$LassoCheckResult]: Stem: 31576#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 31566#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 31549#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 31551#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 31553#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 31554#L59-1 mp_add_~nb~0#1 := 4; 31571#L69 assume !(0 == mp_add_~b3~0#1 % 256); 31573#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 31595#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 31593#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 31574#L84 [2021-12-16 09:32:45,736 INFO L793 eck$LassoCheckResult]: Loop: 31574#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 31575#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 31581#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 31582#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 31599#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 31600#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 31902#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 32905#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 32904#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 32876#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 32475#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 32092#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 31657#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 31654#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 31655#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 32678#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 32897#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 32896#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 32664#L90 assume !(0 == mp_add_~i~0#1 % 256); 32665#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 32629#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 32662#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 32657#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 32658#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 32635#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 32606#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 32603#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 32604#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 32595#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 32596#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 32651#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 32650#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 32473#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 32474#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 32517#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 32516#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 32514#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 32515#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 31908#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 31574#L84 [2021-12-16 09:32:45,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:45,736 INFO L85 PathProgramCache]: Analyzing trace with hash -2147194379, now seen corresponding path program 11 times [2021-12-16 09:32:45,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:45,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636463765] [2021-12-16 09:32:45,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:45,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:45,751 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:32:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:45,759 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:32:45,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:45,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1525293494, now seen corresponding path program 1 times [2021-12-16 09:32:45,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:45,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116682740] [2021-12-16 09:32:45,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:45,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:45,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:45,830 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:45,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:45,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116682740] [2021-12-16 09:32:45,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116682740] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:32:45,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459762664] [2021-12-16 09:32:45,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:45,831 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:32:45,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:45,832 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:32:45,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2021-12-16 09:32:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:45,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 09:32:45,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:32:45,980 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-16 09:32:45,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:32:46,095 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-16 09:32:46,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459762664] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:32:46,096 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:32:46,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2021-12-16 09:32:46,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569507681] [2021-12-16 09:32:46,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:32:46,096 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:46,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:46,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-16 09:32:46,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2021-12-16 09:32:46,097 INFO L87 Difference]: Start difference. First operand 1357 states and 1740 transitions. cyclomatic complexity: 392 Second operand has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 12 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-12-16 09:32:46,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:46,794 INFO L93 Difference]: Finished difference Result 3124 states and 3817 transitions. [2021-12-16 09:32:46,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-16 09:32:46,795 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3124 states and 3817 transitions. [2021-12-16 09:32:46,806 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 2539 [2021-12-16 09:32:46,817 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3124 states to 3124 states and 3817 transitions. [2021-12-16 09:32:46,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3124 [2021-12-16 09:32:46,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3124 [2021-12-16 09:32:46,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3124 states and 3817 transitions. [2021-12-16 09:32:46,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:46,823 INFO L681 BuchiCegarLoop]: Abstraction has 3124 states and 3817 transitions. [2021-12-16 09:32:46,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3124 states and 3817 transitions. [2021-12-16 09:32:46,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3124 to 1202. [2021-12-16 09:32:46,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 1202 states have (on average 1.2703826955074875) internal successors, (1527), 1201 states have internal predecessors, (1527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:46,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1527 transitions. [2021-12-16 09:32:46,849 INFO L704 BuchiCegarLoop]: Abstraction has 1202 states and 1527 transitions. [2021-12-16 09:32:46,849 INFO L587 BuchiCegarLoop]: Abstraction has 1202 states and 1527 transitions. [2021-12-16 09:32:46,849 INFO L425 BuchiCegarLoop]: ======== Iteration 18============ [2021-12-16 09:32:46,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1202 states and 1527 transitions. [2021-12-16 09:32:46,852 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 1002 [2021-12-16 09:32:46,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:46,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:46,853 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:46,853 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:46,853 INFO L791 eck$LassoCheckResult]: Stem: 36335#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 36323#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 36306#L59 assume !(0 == mp_add_~a3~0#1 % 256); 36307#L59-1 mp_add_~nb~0#1 := 4; 36801#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 36800#L71 assume !(0 == mp_add_~b2~0#1 % 256); 36798#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 36797#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 36796#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 36794#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 36793#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 36791#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 36788#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 36781#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 36776#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 36775#L95-1 [2021-12-16 09:32:46,853 INFO L793 eck$LassoCheckResult]: Loop: 36775#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 37492#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 37491#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 37489#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 37487#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 37485#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 37483#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 36617#L84 assume !(0 == mp_add_~i~0#1 % 256); 36618#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 36609#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 36610#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 36601#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 36600#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 36592#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 36593#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 36584#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 36585#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 36576#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 36577#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 36750#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 36570#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 36737#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 36738#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 36785#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 36734#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 36733#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 36775#L95-1 [2021-12-16 09:32:46,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:46,854 INFO L85 PathProgramCache]: Analyzing trace with hash -2095675795, now seen corresponding path program 2 times [2021-12-16 09:32:46,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:46,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53412908] [2021-12-16 09:32:46,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:46,854 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:46,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:46,882 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:46,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53412908] [2021-12-16 09:32:46,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53412908] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:46,882 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:46,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 09:32:46,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550023366] [2021-12-16 09:32:46,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:46,883 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:32:46,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:46,884 INFO L85 PathProgramCache]: Analyzing trace with hash 721949345, now seen corresponding path program 1 times [2021-12-16 09:32:46,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:46,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116836765] [2021-12-16 09:32:46,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:46,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:46,918 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:46,919 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:46,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116836765] [2021-12-16 09:32:46,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116836765] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:46,919 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:46,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 09:32:46,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967310657] [2021-12-16 09:32:46,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:46,920 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:46,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:46,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 09:32:46,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 09:32:46,920 INFO L87 Difference]: Start difference. First operand 1202 states and 1527 transitions. cyclomatic complexity: 336 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-12-16 09:32:46,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:46,924 INFO L93 Difference]: Finished difference Result 694 states and 868 transitions. [2021-12-16 09:32:46,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 09:32:46,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 694 states and 868 transitions. [2021-12-16 09:32:46,927 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 570 [2021-12-16 09:32:46,929 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 694 states to 694 states and 868 transitions. [2021-12-16 09:32:46,929 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 694 [2021-12-16 09:32:46,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 694 [2021-12-16 09:32:46,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 694 states and 868 transitions. [2021-12-16 09:32:46,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:46,931 INFO L681 BuchiCegarLoop]: Abstraction has 694 states and 868 transitions. [2021-12-16 09:32:46,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states and 868 transitions. [2021-12-16 09:32:46,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 694. [2021-12-16 09:32:46,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 694 states have (on average 1.2507204610951008) internal successors, (868), 693 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:46,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 868 transitions. [2021-12-16 09:32:46,939 INFO L704 BuchiCegarLoop]: Abstraction has 694 states and 868 transitions. [2021-12-16 09:32:46,939 INFO L587 BuchiCegarLoop]: Abstraction has 694 states and 868 transitions. [2021-12-16 09:32:46,939 INFO L425 BuchiCegarLoop]: ======== Iteration 19============ [2021-12-16 09:32:46,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 694 states and 868 transitions. [2021-12-16 09:32:46,941 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 570 [2021-12-16 09:32:46,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:46,941 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:46,941 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-12-16 09:32:46,942 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:46,942 INFO L791 eck$LassoCheckResult]: Stem: 38234#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 38223#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 38214#L59 assume !(0 == mp_add_~a3~0#1 % 256); 38215#L59-1 mp_add_~nb~0#1 := 4; 38611#L69 assume !(0 == mp_add_~b3~0#1 % 256); 38610#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 38609#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 38608#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 38607#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 38602#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 38603#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 38594#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 38595#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 38586#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 38587#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 38579#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 38580#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 38573#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 38572#L95-1 [2021-12-16 09:32:46,942 INFO L793 eck$LassoCheckResult]: Loop: 38572#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 38571#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 38570#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 38569#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 38568#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 38567#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 38566#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 38484#L84 assume !(0 == mp_add_~i~0#1 % 256); 38482#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 38481#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 38479#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 38476#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 38474#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 38472#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 38470#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 38468#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 38466#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 38464#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 38461#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 38462#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 38454#L84 assume !(0 == mp_add_~i~0#1 % 256); 38452#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 38450#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 38447#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 38448#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 38556#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 38560#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 38583#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 38576#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 38577#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 38572#L95-1 [2021-12-16 09:32:46,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:46,942 INFO L85 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 1 times [2021-12-16 09:32:46,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:46,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652550621] [2021-12-16 09:32:46,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:46,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:46,952 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:32:46,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:46,974 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:32:46,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:46,974 INFO L85 PathProgramCache]: Analyzing trace with hash 678430955, now seen corresponding path program 1 times [2021-12-16 09:32:46,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:46,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715709222] [2021-12-16 09:32:46,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:46,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:46,988 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-16 09:32:46,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:46,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715709222] [2021-12-16 09:32:46,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715709222] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:46,989 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:46,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 09:32:46,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663539572] [2021-12-16 09:32:46,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:46,989 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:46,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:46,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 09:32:46,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 09:32:46,990 INFO L87 Difference]: Start difference. First operand 694 states and 868 transitions. cyclomatic complexity: 181 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:47,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:47,049 INFO L93 Difference]: Finished difference Result 700 states and 856 transitions. [2021-12-16 09:32:47,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 09:32:47,049 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 700 states and 856 transitions. [2021-12-16 09:32:47,051 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 576 [2021-12-16 09:32:47,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 700 states to 700 states and 856 transitions. [2021-12-16 09:32:47,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 700 [2021-12-16 09:32:47,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 700 [2021-12-16 09:32:47,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 700 states and 856 transitions. [2021-12-16 09:32:47,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:47,055 INFO L681 BuchiCegarLoop]: Abstraction has 700 states and 856 transitions. [2021-12-16 09:32:47,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states and 856 transitions. [2021-12-16 09:32:47,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 693. [2021-12-16 09:32:47,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 693 states have (on average 1.225108225108225) internal successors, (849), 692 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:47,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 849 transitions. [2021-12-16 09:32:47,063 INFO L704 BuchiCegarLoop]: Abstraction has 693 states and 849 transitions. [2021-12-16 09:32:47,063 INFO L587 BuchiCegarLoop]: Abstraction has 693 states and 849 transitions. [2021-12-16 09:32:47,063 INFO L425 BuchiCegarLoop]: ======== Iteration 20============ [2021-12-16 09:32:47,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 693 states and 849 transitions. [2021-12-16 09:32:47,065 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 569 [2021-12-16 09:32:47,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:47,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:47,065 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-12-16 09:32:47,065 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:47,066 INFO L791 eck$LassoCheckResult]: Stem: 39637#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 39625#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 39610#L59 assume !(0 == mp_add_~a3~0#1 % 256); 39611#L59-1 mp_add_~nb~0#1 := 4; 40004#L69 assume !(0 == mp_add_~b3~0#1 % 256); 40003#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 40002#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 40001#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 40000#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 39999#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 39998#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 39997#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 39996#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 39995#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 39994#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 39993#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 39992#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 39990#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 39973#L95-1 [2021-12-16 09:32:47,066 INFO L793 eck$LassoCheckResult]: Loop: 39973#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 39989#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 39985#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 39986#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 39981#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 39982#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 40010#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 39876#L84 assume !(0 == mp_add_~i~0#1 % 256); 39874#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 39873#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 39871#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 39868#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 39866#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 39864#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 39862#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 39860#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 39858#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 39856#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 39853#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 39854#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 39849#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 39850#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 39980#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 39979#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 39978#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 39977#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 39976#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 39975#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 39974#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 39972#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 39973#L95-1 [2021-12-16 09:32:47,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:47,066 INFO L85 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 2 times [2021-12-16 09:32:47,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:47,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827183177] [2021-12-16 09:32:47,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:47,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:47,079 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:32:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:47,091 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:32:47,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:47,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1071457965, now seen corresponding path program 1 times [2021-12-16 09:32:47,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:47,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336162155] [2021-12-16 09:32:47,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:47,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:47,132 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:47,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:47,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336162155] [2021-12-16 09:32:47,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336162155] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:47,132 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:47,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 09:32:47,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596145770] [2021-12-16 09:32:47,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:47,133 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:47,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:47,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 09:32:47,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 09:32:47,134 INFO L87 Difference]: Start difference. First operand 693 states and 849 transitions. cyclomatic complexity: 163 Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:47,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:47,254 INFO L93 Difference]: Finished difference Result 833 states and 994 transitions. [2021-12-16 09:32:47,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 09:32:47,255 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 833 states and 994 transitions. [2021-12-16 09:32:47,257 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 699 [2021-12-16 09:32:47,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 833 states to 833 states and 994 transitions. [2021-12-16 09:32:47,260 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 833 [2021-12-16 09:32:47,260 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 833 [2021-12-16 09:32:47,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 833 states and 994 transitions. [2021-12-16 09:32:47,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:47,261 INFO L681 BuchiCegarLoop]: Abstraction has 833 states and 994 transitions. [2021-12-16 09:32:47,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states and 994 transitions. [2021-12-16 09:32:47,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 694. [2021-12-16 09:32:47,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 694 states have (on average 1.2146974063400577) internal successors, (843), 693 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:47,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 843 transitions. [2021-12-16 09:32:47,270 INFO L704 BuchiCegarLoop]: Abstraction has 694 states and 843 transitions. [2021-12-16 09:32:47,270 INFO L587 BuchiCegarLoop]: Abstraction has 694 states and 843 transitions. [2021-12-16 09:32:47,270 INFO L425 BuchiCegarLoop]: ======== Iteration 21============ [2021-12-16 09:32:47,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 694 states and 843 transitions. [2021-12-16 09:32:47,272 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 570 [2021-12-16 09:32:47,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:47,272 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:47,272 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-12-16 09:32:47,272 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [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-12-16 09:32:47,273 INFO L791 eck$LassoCheckResult]: Stem: 41173#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 41160#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 41151#L59 assume !(0 == mp_add_~a3~0#1 % 256); 41152#L59-1 mp_add_~nb~0#1 := 4; 41453#L69 assume !(0 == mp_add_~b3~0#1 % 256); 41452#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 41449#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 41445#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 41442#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 41440#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 41438#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 41436#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 41434#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 41432#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 41430#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 41428#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 41426#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 41423#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 41421#L95-1 [2021-12-16 09:32:47,273 INFO L793 eck$LassoCheckResult]: Loop: 41421#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 41419#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 41417#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 41415#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 41413#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 41410#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 41407#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 41393#L84 assume !(0 == mp_add_~i~0#1 % 256); 41394#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 41391#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 41389#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 41386#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 41384#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 41382#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 41380#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 41378#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 41376#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 41374#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 41371#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 41372#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 41499#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 41497#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 41494#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 41495#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 41541#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 41538#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 41457#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 41451#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 41448#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 41443#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 41441#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 41439#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 41437#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 41435#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 41433#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 41431#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 41429#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 41427#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 41425#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 41421#L95-1 [2021-12-16 09:32:47,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:47,273 INFO L85 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 3 times [2021-12-16 09:32:47,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:47,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335822741] [2021-12-16 09:32:47,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:47,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:47,283 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:32:47,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:47,297 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:32:47,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:47,297 INFO L85 PathProgramCache]: Analyzing trace with hash 2030860210, now seen corresponding path program 1 times [2021-12-16 09:32:47,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:47,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015931666] [2021-12-16 09:32:47,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:47,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:47,395 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:47,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:47,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015931666] [2021-12-16 09:32:47,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015931666] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:32:47,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655774050] [2021-12-16 09:32:47,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:47,397 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:32:47,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:47,399 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:32:47,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2021-12-16 09:32:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:47,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-16 09:32:47,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:32:47,567 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-16 09:32:47,567 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 09:32:47,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655774050] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:47,567 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 09:32:47,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2021-12-16 09:32:47,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187288640] [2021-12-16 09:32:47,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:47,568 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:47,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:47,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 09:32:47,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-16 09:32:47,569 INFO L87 Difference]: Start difference. First operand 694 states and 843 transitions. cyclomatic complexity: 156 Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 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-12-16 09:32:47,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:47,685 INFO L93 Difference]: Finished difference Result 782 states and 935 transitions. [2021-12-16 09:32:47,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 09:32:47,686 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 782 states and 935 transitions. [2021-12-16 09:32:47,688 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 658 [2021-12-16 09:32:47,691 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 782 states to 782 states and 935 transitions. [2021-12-16 09:32:47,691 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 782 [2021-12-16 09:32:47,691 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 782 [2021-12-16 09:32:47,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 782 states and 935 transitions. [2021-12-16 09:32:47,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:47,692 INFO L681 BuchiCegarLoop]: Abstraction has 782 states and 935 transitions. [2021-12-16 09:32:47,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states and 935 transitions. [2021-12-16 09:32:47,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 678. [2021-12-16 09:32:47,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 678 states have (on average 1.2094395280235988) internal successors, (820), 677 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:47,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 820 transitions. [2021-12-16 09:32:47,701 INFO L704 BuchiCegarLoop]: Abstraction has 678 states and 820 transitions. [2021-12-16 09:32:47,701 INFO L587 BuchiCegarLoop]: Abstraction has 678 states and 820 transitions. [2021-12-16 09:32:47,701 INFO L425 BuchiCegarLoop]: ======== Iteration 22============ [2021-12-16 09:32:47,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 678 states and 820 transitions. [2021-12-16 09:32:47,702 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 570 [2021-12-16 09:32:47,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:47,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:47,703 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:47,703 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:47,703 INFO L791 eck$LassoCheckResult]: Stem: 42775#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 42763#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 42748#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 42750#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 42752#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 42753#L59-1 mp_add_~nb~0#1 := 4; 42768#L69 assume !(0 == mp_add_~b3~0#1 % 256); 42795#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 42796#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 43263#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 43335#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 43334#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 43333#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 43331#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 43330#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 43328#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 42886#L90-2 [2021-12-16 09:32:47,703 INFO L793 eck$LassoCheckResult]: Loop: 42886#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 43324#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 43323#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 43319#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 43318#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 43317#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 43316#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 43315#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 43314#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 42778#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 42779#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 43179#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 43176#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 42917#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 42868#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 42851#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 42846#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 42840#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 42838#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 42837#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 42836#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 42830#L90 assume !(0 == mp_add_~i~0#1 % 256); 42833#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 42831#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 42827#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 42828#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 42889#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 42887#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 42884#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 42881#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 42879#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 42877#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 42875#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 42872#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 42867#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 42866#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 42864#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 42862#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 42860#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 42859#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 42856#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 42857#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 42888#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 42885#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 42886#L90-2 [2021-12-16 09:32:47,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:47,705 INFO L85 PathProgramCache]: Analyzing trace with hash -585420154, now seen corresponding path program 1 times [2021-12-16 09:32:47,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:47,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829481043] [2021-12-16 09:32:47,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:47,705 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:47,712 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:32:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:47,720 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:32:47,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:47,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1365924643, now seen corresponding path program 1 times [2021-12-16 09:32:47,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:47,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896109476] [2021-12-16 09:32:47,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:47,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:47,764 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-16 09:32:47,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:47,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896109476] [2021-12-16 09:32:47,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896109476] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:47,765 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:47,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 09:32:47,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721807357] [2021-12-16 09:32:47,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:47,765 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:47,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:47,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 09:32:47,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-16 09:32:47,766 INFO L87 Difference]: Start difference. First operand 678 states and 820 transitions. cyclomatic complexity: 149 Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 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-12-16 09:32:47,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:47,985 INFO L93 Difference]: Finished difference Result 1148 states and 1367 transitions. [2021-12-16 09:32:47,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 09:32:47,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1148 states and 1367 transitions. [2021-12-16 09:32:47,989 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 866 [2021-12-16 09:32:47,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1148 states to 1132 states and 1340 transitions. [2021-12-16 09:32:47,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1132 [2021-12-16 09:32:47,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1132 [2021-12-16 09:32:47,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1132 states and 1340 transitions. [2021-12-16 09:32:47,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:47,994 INFO L681 BuchiCegarLoop]: Abstraction has 1132 states and 1340 transitions. [2021-12-16 09:32:47,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states and 1340 transitions. [2021-12-16 09:32:48,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 949. [2021-12-16 09:32:48,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 949 states have (on average 1.2002107481559536) internal successors, (1139), 948 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:48,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1139 transitions. [2021-12-16 09:32:48,005 INFO L704 BuchiCegarLoop]: Abstraction has 949 states and 1139 transitions. [2021-12-16 09:32:48,006 INFO L587 BuchiCegarLoop]: Abstraction has 949 states and 1139 transitions. [2021-12-16 09:32:48,006 INFO L425 BuchiCegarLoop]: ======== Iteration 23============ [2021-12-16 09:32:48,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 949 states and 1139 transitions. [2021-12-16 09:32:48,008 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 755 [2021-12-16 09:32:48,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:48,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:48,008 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:48,008 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:48,009 INFO L791 eck$LassoCheckResult]: Stem: 44618#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 44607#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 44592#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 44594#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 44596#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 44597#L59-1 mp_add_~nb~0#1 := 4; 44612#L69 assume !(0 == mp_add_~b3~0#1 % 256); 44636#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 44637#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 45118#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 45119#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 45345#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 45344#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 45342#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 45340#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 45338#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 44745#L90-2 [2021-12-16 09:32:48,009 INFO L793 eck$LassoCheckResult]: Loop: 44745#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 45337#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 45336#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 45335#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 45333#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 45331#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 45329#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 45327#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 45325#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 45321#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 45295#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 45296#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 45217#L90 assume !(0 == mp_add_~i~0#1 % 256); 44688#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 44687#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 44685#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 44682#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 44680#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 44678#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 44675#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 44673#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 44671#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 44670#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 44668#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 44665#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 44662#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 44661#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 44660#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 44659#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 44658#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 44657#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 44655#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 44656#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 44758#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 44757#L90 assume !(0 == mp_add_~i~0#1 % 256); 44756#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 44755#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 44754#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 44752#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 44753#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 44730#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 44728#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 44726#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 44713#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 44714#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 44720#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 44747#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 44740#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 44745#L90-2 [2021-12-16 09:32:48,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:48,009 INFO L85 PathProgramCache]: Analyzing trace with hash -585420154, now seen corresponding path program 2 times [2021-12-16 09:32:48,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:48,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524389450] [2021-12-16 09:32:48,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:48,010 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:48,017 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:32:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:48,025 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:32:48,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:48,026 INFO L85 PathProgramCache]: Analyzing trace with hash 424048757, now seen corresponding path program 1 times [2021-12-16 09:32:48,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:48,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704773730] [2021-12-16 09:32:48,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:48,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:48,110 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-16 09:32:48,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:48,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704773730] [2021-12-16 09:32:48,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704773730] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:48,111 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:48,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 09:32:48,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606284092] [2021-12-16 09:32:48,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:48,112 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:48,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:48,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 09:32:48,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-16 09:32:48,112 INFO L87 Difference]: Start difference. First operand 949 states and 1139 transitions. cyclomatic complexity: 199 Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:48,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:48,441 INFO L93 Difference]: Finished difference Result 1390 states and 1655 transitions. [2021-12-16 09:32:48,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 09:32:48,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1390 states and 1655 transitions. [2021-12-16 09:32:48,446 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1015 [2021-12-16 09:32:48,449 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1390 states to 1379 states and 1643 transitions. [2021-12-16 09:32:48,449 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1379 [2021-12-16 09:32:48,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1379 [2021-12-16 09:32:48,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1379 states and 1643 transitions. [2021-12-16 09:32:48,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:48,451 INFO L681 BuchiCegarLoop]: Abstraction has 1379 states and 1643 transitions. [2021-12-16 09:32:48,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states and 1643 transitions. [2021-12-16 09:32:48,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1207. [2021-12-16 09:32:48,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1207 states, 1207 states have (on average 1.2054681027340515) internal successors, (1455), 1206 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:48,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1455 transitions. [2021-12-16 09:32:48,464 INFO L704 BuchiCegarLoop]: Abstraction has 1207 states and 1455 transitions. [2021-12-16 09:32:48,464 INFO L587 BuchiCegarLoop]: Abstraction has 1207 states and 1455 transitions. [2021-12-16 09:32:48,464 INFO L425 BuchiCegarLoop]: ======== Iteration 24============ [2021-12-16 09:32:48,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1207 states and 1455 transitions. [2021-12-16 09:32:48,467 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 946 [2021-12-16 09:32:48,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:48,467 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:48,468 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:48,468 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:48,468 INFO L791 eck$LassoCheckResult]: Stem: 46981#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 46970#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 46956#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 46958#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 46960#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 46961#L59-1 mp_add_~nb~0#1 := 4; 46975#L69 assume !(0 == mp_add_~b3~0#1 % 256); 47000#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 47001#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 47933#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 47934#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 48075#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 48074#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 48073#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 48072#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 48070#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 47136#L90-2 [2021-12-16 09:32:48,468 INFO L793 eck$LassoCheckResult]: Loop: 47136#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 48069#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 48068#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 48067#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 48065#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 48063#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 48061#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 48059#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 48057#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 48053#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 48054#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 48162#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 47148#L90 assume !(0 == mp_add_~i~0#1 % 256); 47080#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 47078#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 47076#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 47074#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 47072#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 47069#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 47066#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 47063#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 47060#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 47056#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 47053#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 47050#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 47048#L90 assume !(0 == mp_add_~i~0#1 % 256); 47047#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 47046#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 47043#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 47044#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 47125#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 47124#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 47123#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 47121#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 47119#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 47118#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 47116#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 47113#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 47108#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 47104#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 47102#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 47099#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 47097#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 47096#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 47094#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 47095#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 47138#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 47130#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 47136#L90-2 [2021-12-16 09:32:48,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:48,469 INFO L85 PathProgramCache]: Analyzing trace with hash -585420154, now seen corresponding path program 3 times [2021-12-16 09:32:48,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:48,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790090562] [2021-12-16 09:32:48,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:48,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:48,477 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:32:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:48,487 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:32:48,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:48,488 INFO L85 PathProgramCache]: Analyzing trace with hash 190179469, now seen corresponding path program 1 times [2021-12-16 09:32:48,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:48,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838757617] [2021-12-16 09:32:48,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:48,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:48,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:48,530 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-12-16 09:32:48,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:48,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838757617] [2021-12-16 09:32:48,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838757617] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:48,531 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:48,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 09:32:48,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796314484] [2021-12-16 09:32:48,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:48,531 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:48,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:48,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 09:32:48,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 09:32:48,532 INFO L87 Difference]: Start difference. First operand 1207 states and 1455 transitions. cyclomatic complexity: 259 Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:48,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:48,653 INFO L93 Difference]: Finished difference Result 1554 states and 1837 transitions. [2021-12-16 09:32:48,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 09:32:48,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1554 states and 1837 transitions. [2021-12-16 09:32:48,658 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 1199 [2021-12-16 09:32:48,661 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1554 states to 1551 states and 1832 transitions. [2021-12-16 09:32:48,661 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1551 [2021-12-16 09:32:48,661 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1551 [2021-12-16 09:32:48,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1551 states and 1832 transitions. [2021-12-16 09:32:48,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:48,663 INFO L681 BuchiCegarLoop]: Abstraction has 1551 states and 1832 transitions. [2021-12-16 09:32:48,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states and 1832 transitions. [2021-12-16 09:32:48,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1243. [2021-12-16 09:32:48,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1243 states, 1243 states have (on average 1.2003218020917137) internal successors, (1492), 1242 states have internal predecessors, (1492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:48,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1492 transitions. [2021-12-16 09:32:48,676 INFO L704 BuchiCegarLoop]: Abstraction has 1243 states and 1492 transitions. [2021-12-16 09:32:48,677 INFO L587 BuchiCegarLoop]: Abstraction has 1243 states and 1492 transitions. [2021-12-16 09:32:48,677 INFO L425 BuchiCegarLoop]: ======== Iteration 25============ [2021-12-16 09:32:48,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1243 states and 1492 transitions. [2021-12-16 09:32:48,679 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 960 [2021-12-16 09:32:48,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:48,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:48,680 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:48,680 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:48,680 INFO L791 eck$LassoCheckResult]: Stem: 49753#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 49740#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 49731#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 49733#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 49735#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 49736#L59-1 mp_add_~nb~0#1 := 4; 49745#L69 assume !(0 == mp_add_~b3~0#1 % 256); 49771#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 49754#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 49755#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 50916#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 50915#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 50914#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 50913#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 50911#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 50910#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 50908#L90-2 [2021-12-16 09:32:48,680 INFO L793 eck$LassoCheckResult]: Loop: 50908#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 50907#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 50906#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 50904#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 50905#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 50965#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 50966#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 50952#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 50953#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 50968#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 50328#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 50327#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 50824#L90 assume !(0 == mp_add_~i~0#1 % 256); 49837#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 49835#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 49833#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 49831#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 49827#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 49824#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 49821#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 49818#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 49815#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 49812#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 49809#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 49806#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 49805#L90 assume !(0 == mp_add_~i~0#1 % 256); 49804#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 49803#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 49800#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 49801#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 49913#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 49912#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 49910#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 49908#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 49907#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 49905#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 49903#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 49900#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 49884#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 49882#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 49881#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 49880#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 49876#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 49875#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 49849#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 49850#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 50912#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 49890#L90 assume !(0 == mp_add_~i~0#1 % 256); 49921#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 49920#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 49919#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 49918#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 49899#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 49879#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 49863#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 49862#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 49860#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 49858#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 49859#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 49922#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 49923#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 50908#L90-2 [2021-12-16 09:32:48,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:48,681 INFO L85 PathProgramCache]: Analyzing trace with hash -585420154, now seen corresponding path program 4 times [2021-12-16 09:32:48,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:48,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56553570] [2021-12-16 09:32:48,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:48,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:48,688 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:32:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:48,695 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:32:48,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:48,696 INFO L85 PathProgramCache]: Analyzing trace with hash 699737054, now seen corresponding path program 2 times [2021-12-16 09:32:48,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:48,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649376440] [2021-12-16 09:32:48,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:48,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:48,775 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-12-16 09:32:48,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:48,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649376440] [2021-12-16 09:32:48,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649376440] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:32:48,776 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:32:48,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 09:32:48,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784917191] [2021-12-16 09:32:48,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:32:48,777 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:32:48,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:32:48,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 09:32:48,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-16 09:32:48,777 INFO L87 Difference]: Start difference. First operand 1243 states and 1492 transitions. cyclomatic complexity: 260 Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:49,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:32:49,152 INFO L93 Difference]: Finished difference Result 1591 states and 1886 transitions. [2021-12-16 09:32:49,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-16 09:32:49,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1591 states and 1886 transitions. [2021-12-16 09:32:49,157 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 1176 [2021-12-16 09:32:49,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1591 states to 1580 states and 1872 transitions. [2021-12-16 09:32:49,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1580 [2021-12-16 09:32:49,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1580 [2021-12-16 09:32:49,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1580 states and 1872 transitions. [2021-12-16 09:32:49,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:32:49,167 INFO L681 BuchiCegarLoop]: Abstraction has 1580 states and 1872 transitions. [2021-12-16 09:32:49,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states and 1872 transitions. [2021-12-16 09:32:49,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1447. [2021-12-16 09:32:49,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 1447 states have (on average 1.2011057360055286) internal successors, (1738), 1446 states have internal predecessors, (1738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:32:49,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 1738 transitions. [2021-12-16 09:32:49,181 INFO L704 BuchiCegarLoop]: Abstraction has 1447 states and 1738 transitions. [2021-12-16 09:32:49,181 INFO L587 BuchiCegarLoop]: Abstraction has 1447 states and 1738 transitions. [2021-12-16 09:32:49,182 INFO L425 BuchiCegarLoop]: ======== Iteration 26============ [2021-12-16 09:32:49,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1447 states and 1738 transitions. [2021-12-16 09:32:49,184 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 1127 [2021-12-16 09:32:49,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:32:49,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:32:49,187 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:49,187 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:32:49,187 INFO L791 eck$LassoCheckResult]: Stem: 52618#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 52606#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 52592#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 52594#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 52596#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 52597#L59-1 mp_add_~nb~0#1 := 4; 52611#L69 assume !(0 == mp_add_~b3~0#1 % 256); 52635#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 52636#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 53945#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 53944#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 53943#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 53942#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 53941#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 53940#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 53936#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 53935#L90-2 [2021-12-16 09:32:49,187 INFO L793 eck$LassoCheckResult]: Loop: 53935#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 53934#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 53933#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 53931#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 53930#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 53929#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 53928#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 53927#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 53926#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 53925#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 53924#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 53921#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 52839#L90 assume !(0 == mp_add_~i~0#1 % 256); 52751#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 52691#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 52750#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 52748#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 52746#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 52747#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 52743#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 52742#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 52740#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 52741#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 52806#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 52729#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 52728#L90 assume !(0 == mp_add_~i~0#1 % 256); 52727#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 52726#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 52725#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 52724#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 52722#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 52720#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 52718#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 52716#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 52714#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 52711#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 52707#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 52708#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 52703#L90 assume !(0 == mp_add_~i~0#1 % 256); 52702#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 52701#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 52700#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 52698#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 52697#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 52696#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 52695#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 52694#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 52693#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 52692#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 52689#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 52685#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 52687#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 52680#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 52681#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 52678#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 52677#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 52673#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 52671#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 52672#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 52705#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 52706#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 53935#L90-2 [2021-12-16 09:32:49,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:49,188 INFO L85 PathProgramCache]: Analyzing trace with hash -585420154, now seen corresponding path program 5 times [2021-12-16 09:32:49,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:49,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775034964] [2021-12-16 09:32:49,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:49,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:49,196 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:32:49,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:32:49,204 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:32:49,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:32:49,205 INFO L85 PathProgramCache]: Analyzing trace with hash 577651134, now seen corresponding path program 1 times [2021-12-16 09:32:49,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:32:49,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719353220] [2021-12-16 09:32:49,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:49,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:32:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:49,282 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 17 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:32:49,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:32:49,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719353220] [2021-12-16 09:32:49,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719353220] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:32:49,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346209402] [2021-12-16 09:32:49,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:32:49,283 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:32:49,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:32:49,287 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:32:49,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2021-12-16 09:32:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:32:49,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 09:32:49,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:33:01,682 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 57 proven. 9 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-12-16 09:33:01,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:33:01,813 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 57 proven. 9 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-12-16 09:33:01,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346209402] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:33:01,813 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:33:01,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 12 [2021-12-16 09:33:01,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391089858] [2021-12-16 09:33:01,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:33:01,814 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:33:01,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:33:01,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-16 09:33:01,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=109, Unknown=1, NotChecked=0, Total=156 [2021-12-16 09:33:01,814 INFO L87 Difference]: Start difference. First operand 1447 states and 1738 transitions. cyclomatic complexity: 304 Second operand has 13 states, 12 states have (on average 9.25) internal successors, (111), 13 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:33:02,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:33:02,424 INFO L93 Difference]: Finished difference Result 1762 states and 2052 transitions. [2021-12-16 09:33:02,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-16 09:33:02,424 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1762 states and 2052 transitions. [2021-12-16 09:33:02,429 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 1114 [2021-12-16 09:33:02,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1762 states to 1535 states and 1723 transitions. [2021-12-16 09:33:02,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1535 [2021-12-16 09:33:02,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1535 [2021-12-16 09:33:02,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1535 states and 1723 transitions. [2021-12-16 09:33:02,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:33:02,434 INFO L681 BuchiCegarLoop]: Abstraction has 1535 states and 1723 transitions. [2021-12-16 09:33:02,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states and 1723 transitions. [2021-12-16 09:33:02,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 934. [2021-12-16 09:33:02,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 934 states have (on average 1.1531049250535332) internal successors, (1077), 933 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:33:02,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1077 transitions. [2021-12-16 09:33:02,446 INFO L704 BuchiCegarLoop]: Abstraction has 934 states and 1077 transitions. [2021-12-16 09:33:02,446 INFO L587 BuchiCegarLoop]: Abstraction has 934 states and 1077 transitions. [2021-12-16 09:33:02,446 INFO L425 BuchiCegarLoop]: ======== Iteration 27============ [2021-12-16 09:33:02,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 934 states and 1077 transitions. [2021-12-16 09:33:02,448 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 811 [2021-12-16 09:33:02,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:33:02,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:33:02,449 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:33:02,449 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:33:02,449 INFO L791 eck$LassoCheckResult]: Stem: 56211#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 56200#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 56191#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 56193#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 56195#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 56196#L59-1 mp_add_~nb~0#1 := 4; 56205#L69 assume !(0 == mp_add_~b3~0#1 % 256); 56226#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 56227#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 56972#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 56973#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 56224#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 56225#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 57059#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 57060#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 57057#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 57056#L90-2 [2021-12-16 09:33:02,450 INFO L793 eck$LassoCheckResult]: Loop: 57056#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 57055#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 57054#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 57053#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 57052#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 56206#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 56198#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 56199#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 56218#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 56213#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 56214#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 57086#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 57085#L90 assume !(0 == mp_add_~i~0#1 % 256); 57076#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 57072#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 57075#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 57074#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 57073#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 56804#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 56805#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 56796#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 56797#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 57049#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 57048#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 56343#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 56344#L90 assume !(0 == mp_add_~i~0#1 % 256); 56339#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 56340#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 56269#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 56270#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 56264#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 56265#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 56260#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 56261#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 56256#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 56257#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 57022#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 57021#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 56247#L90 assume !(0 == mp_add_~i~0#1 % 256); 56248#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 56243#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 56244#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 56970#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 56676#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 57119#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 57118#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 57117#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 56235#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 57116#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 57084#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 56428#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 56376#L90 assume !(0 == mp_add_~i~0#1 % 256); 57071#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 57070#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 57069#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 57068#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 57067#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 57066#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 57065#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 57064#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 57063#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 57062#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 57061#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 56420#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 57058#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 57056#L90-2 [2021-12-16 09:33:02,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:33:02,450 INFO L85 PathProgramCache]: Analyzing trace with hash -585420154, now seen corresponding path program 6 times [2021-12-16 09:33:02,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:33:02,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193066903] [2021-12-16 09:33:02,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:33:02,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:33:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:33:02,458 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:33:02,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:33:02,465 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:33:02,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:33:02,466 INFO L85 PathProgramCache]: Analyzing trace with hash 118306094, now seen corresponding path program 1 times [2021-12-16 09:33:02,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:33:02,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465435717] [2021-12-16 09:33:02,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:33:02,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:33:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:33:02,548 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 20 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:33:02,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:33:02,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465435717] [2021-12-16 09:33:02,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465435717] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:33:02,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483605780] [2021-12-16 09:33:02,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:33:02,549 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:33:02,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:02,550 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:33:02,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2021-12-16 09:33:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:33:02,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 09:33:02,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:33:02,992 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 72 proven. 10 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-12-16 09:33:02,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:33:03,158 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 72 proven. 10 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-12-16 09:33:03,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483605780] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:33:03,158 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:33:03,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 12 [2021-12-16 09:33:03,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42121252] [2021-12-16 09:33:03,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:33:03,159 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:33:03,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:33:03,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-16 09:33:03,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2021-12-16 09:33:03,159 INFO L87 Difference]: Start difference. First operand 934 states and 1077 transitions. cyclomatic complexity: 152 Second operand has 13 states, 12 states have (on average 10.25) internal successors, (123), 13 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:33:03,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:33:03,757 INFO L93 Difference]: Finished difference Result 1189 states and 1364 transitions. [2021-12-16 09:33:03,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 09:33:03,757 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1189 states and 1364 transitions. [2021-12-16 09:33:03,761 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 993 [2021-12-16 09:33:03,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1189 states to 1189 states and 1364 transitions. [2021-12-16 09:33:03,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1189 [2021-12-16 09:33:03,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1189 [2021-12-16 09:33:03,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1189 states and 1364 transitions. [2021-12-16 09:33:03,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:33:03,765 INFO L681 BuchiCegarLoop]: Abstraction has 1189 states and 1364 transitions. [2021-12-16 09:33:03,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states and 1364 transitions. [2021-12-16 09:33:03,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 865. [2021-12-16 09:33:03,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 865 states have (on average 1.1433526011560693) internal successors, (989), 864 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:33:03,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 989 transitions. [2021-12-16 09:33:03,775 INFO L704 BuchiCegarLoop]: Abstraction has 865 states and 989 transitions. [2021-12-16 09:33:03,775 INFO L587 BuchiCegarLoop]: Abstraction has 865 states and 989 transitions. [2021-12-16 09:33:03,775 INFO L425 BuchiCegarLoop]: ======== Iteration 28============ [2021-12-16 09:33:03,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 865 states and 989 transitions. [2021-12-16 09:33:03,776 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 726 [2021-12-16 09:33:03,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:33:03,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:33:03,777 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-12-16 09:33:03,777 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:33:03,777 INFO L791 eck$LassoCheckResult]: Stem: 58741#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 58730#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 58717#L59 assume !(0 == mp_add_~a3~0#1 % 256); 58718#L59-1 mp_add_~nb~0#1 := 4; 59465#L69 assume !(0 == mp_add_~b3~0#1 % 256); 59464#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 59463#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 59462#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 59460#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 59461#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 59456#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 59457#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 59452#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 59453#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 59448#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 59449#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 59444#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 59445#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 59443#L95-1 [2021-12-16 09:33:03,781 INFO L793 eck$LassoCheckResult]: Loop: 59443#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 59438#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 59439#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 59434#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 59435#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 59430#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 59431#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 59428#L84 assume !(0 == mp_add_~i~0#1 % 256); 58836#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 58835#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 58834#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 58832#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 58831#L90 assume !(0 == mp_add_~i~0#1 % 256); 58830#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 58829#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 58828#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 58827#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 58826#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 58825#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 58824#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 58823#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 58822#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 58821#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 58819#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 58818#L84 assume !(0 == mp_add_~i~0#1 % 256); 58817#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 58816#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 58815#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 58813#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 58812#L90 assume !(0 == mp_add_~i~0#1 % 256); 58811#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 58810#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 58809#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 58808#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 58806#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 58804#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 58802#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 58800#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 58798#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 58796#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 58792#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 58791#L84 assume !(0 == mp_add_~i~0#1 % 256); 58790#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 58789#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 58786#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 58779#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 58780#L90 assume !(0 == mp_add_~i~0#1 % 256); 59423#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 59422#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 59421#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 59420#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 59418#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 59416#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 59414#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 59412#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 59410#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 59407#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 59408#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 59486#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 59485#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 59484#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 59483#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 59482#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 59481#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 59480#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 59479#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 59148#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 59149#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 59458#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 59459#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 59454#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 59455#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 59450#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 59451#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 59446#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 59447#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 59442#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 59443#L95-1 [2021-12-16 09:33:03,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:33:03,782 INFO L85 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 4 times [2021-12-16 09:33:03,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:33:03,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668136178] [2021-12-16 09:33:03,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:33:03,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:33:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:33:03,791 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:33:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:33:03,802 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:33:03,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:33:03,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1167859478, now seen corresponding path program 1 times [2021-12-16 09:33:03,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:33:03,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709842817] [2021-12-16 09:33:03,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:33:03,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:33:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:33:03,900 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 33 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:33:03,900 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:33:03,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709842817] [2021-12-16 09:33:03,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709842817] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:33:03,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534694213] [2021-12-16 09:33:03,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:33:03,901 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:33:03,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:03,907 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:33:03,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2021-12-16 09:33:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:33:04,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 09:33:04,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:33:04,402 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 90 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-12-16 09:33:04,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:33:04,579 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 90 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-12-16 09:33:04,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534694213] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:33:04,579 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:33:04,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2021-12-16 09:33:04,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110153828] [2021-12-16 09:33:04,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:33:04,580 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:33:04,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:33:04,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-16 09:33:04,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2021-12-16 09:33:04,581 INFO L87 Difference]: Start difference. First operand 865 states and 989 transitions. cyclomatic complexity: 133 Second operand has 13 states, 13 states have (on average 10.692307692307692) internal successors, (139), 13 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:33:05,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:33:05,019 INFO L93 Difference]: Finished difference Result 1154 states and 1315 transitions. [2021-12-16 09:33:05,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-16 09:33:05,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1154 states and 1315 transitions. [2021-12-16 09:33:05,025 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 910 [2021-12-16 09:33:05,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1154 states to 1154 states and 1315 transitions. [2021-12-16 09:33:05,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1154 [2021-12-16 09:33:05,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1154 [2021-12-16 09:33:05,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1154 states and 1315 transitions. [2021-12-16 09:33:05,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:33:05,029 INFO L681 BuchiCegarLoop]: Abstraction has 1154 states and 1315 transitions. [2021-12-16 09:33:05,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states and 1315 transitions. [2021-12-16 09:33:05,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 813. [2021-12-16 09:33:05,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 813 states have (on average 1.137761377613776) internal successors, (925), 812 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:33:05,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 925 transitions. [2021-12-16 09:33:05,039 INFO L704 BuchiCegarLoop]: Abstraction has 813 states and 925 transitions. [2021-12-16 09:33:05,039 INFO L587 BuchiCegarLoop]: Abstraction has 813 states and 925 transitions. [2021-12-16 09:33:05,039 INFO L425 BuchiCegarLoop]: ======== Iteration 29============ [2021-12-16 09:33:05,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 813 states and 925 transitions. [2021-12-16 09:33:05,041 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 656 [2021-12-16 09:33:05,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:33:05,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:33:05,041 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-12-16 09:33:05,041 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:33:05,041 INFO L791 eck$LassoCheckResult]: Stem: 61245#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 61234#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 61220#L59 assume !(0 == mp_add_~a3~0#1 % 256); 61221#L59-1 mp_add_~nb~0#1 := 4; 61241#L69 assume !(0 == mp_add_~b3~0#1 % 256); 61242#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 61261#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 61962#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 61961#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 61960#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 61959#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 61958#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 61957#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 61956#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 61955#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 61954#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 61953#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 61936#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 61934#L95-1 [2021-12-16 09:33:05,042 INFO L793 eck$LassoCheckResult]: Loop: 61934#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 61932#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 61930#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 61928#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 61926#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 61924#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 61911#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 61912#L84 assume !(0 == mp_add_~i~0#1 % 256); 61342#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 61341#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 61340#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 61338#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 61337#L90 assume !(0 == mp_add_~i~0#1 % 256); 61336#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 61335#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 61334#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 61333#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 61332#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 61331#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 61330#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 61329#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 61328#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 61327#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 61325#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 61324#L84 assume !(0 == mp_add_~i~0#1 % 256); 61323#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 61322#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 61321#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 61319#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 61318#L90 assume !(0 == mp_add_~i~0#1 % 256); 61317#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 61316#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 61315#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 61314#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 61312#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 61310#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 61308#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 61306#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 61304#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 61302#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 61298#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 61297#L84 assume !(0 == mp_add_~i~0#1 % 256); 61296#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 61295#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 61292#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 61286#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 61287#L90 assume !(0 == mp_add_~i~0#1 % 256); 61864#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 61863#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 61862#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 61861#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 61859#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 61857#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 61855#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 61853#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 61851#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 61848#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 61849#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 61844#L84 assume !(0 == mp_add_~i~0#1 % 256); 61843#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 61842#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 61841#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 61840#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 61839#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 61837#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 61835#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 61833#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 61831#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 61829#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 61827#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 61824#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 61825#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 61952#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 61951#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 61950#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 61948#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 61946#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 61944#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 61942#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 61940#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 61938#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 61934#L95-1 [2021-12-16 09:33:05,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:33:05,042 INFO L85 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 5 times [2021-12-16 09:33:05,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:33:05,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430468864] [2021-12-16 09:33:05,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:33:05,042 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:33:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:33:05,052 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:33:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:33:05,061 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:33:05,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:33:05,062 INFO L85 PathProgramCache]: Analyzing trace with hash -2066940636, now seen corresponding path program 1 times [2021-12-16 09:33:05,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:33:05,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799153476] [2021-12-16 09:33:05,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:33:05,062 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:33:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:33:05,165 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 36 proven. 118 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:33:05,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:33:05,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799153476] [2021-12-16 09:33:05,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799153476] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:33:05,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87851313] [2021-12-16 09:33:05,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:33:05,166 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:33:05,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:05,171 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:33:05,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2021-12-16 09:33:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:33:05,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-16 09:33:05,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:33:06,089 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 105 proven. 10 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-12-16 09:33:06,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:33:06,248 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 81 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-16 09:33:06,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87851313] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:33:06,249 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:33:06,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 4] total 14 [2021-12-16 09:33:06,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973106466] [2021-12-16 09:33:06,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:33:06,249 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:33:06,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:33:06,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-16 09:33:06,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-12-16 09:33:06,250 INFO L87 Difference]: Start difference. First operand 813 states and 925 transitions. cyclomatic complexity: 121 Second operand has 14 states, 14 states have (on average 10.785714285714286) internal successors, (151), 14 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:33:06,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:33:06,905 INFO L93 Difference]: Finished difference Result 1012 states and 1146 transitions. [2021-12-16 09:33:06,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-16 09:33:06,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1012 states and 1146 transitions. [2021-12-16 09:33:06,909 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 692 [2021-12-16 09:33:06,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1012 states to 900 states and 1010 transitions. [2021-12-16 09:33:06,911 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 900 [2021-12-16 09:33:06,911 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 900 [2021-12-16 09:33:06,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 900 states and 1010 transitions. [2021-12-16 09:33:06,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:33:06,912 INFO L681 BuchiCegarLoop]: Abstraction has 900 states and 1010 transitions. [2021-12-16 09:33:06,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states and 1010 transitions. [2021-12-16 09:33:06,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 589. [2021-12-16 09:33:06,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 589 states have (on average 1.1239388794567062) internal successors, (662), 588 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:33:06,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 662 transitions. [2021-12-16 09:33:06,920 INFO L704 BuchiCegarLoop]: Abstraction has 589 states and 662 transitions. [2021-12-16 09:33:06,920 INFO L587 BuchiCegarLoop]: Abstraction has 589 states and 662 transitions. [2021-12-16 09:33:06,920 INFO L425 BuchiCegarLoop]: ======== Iteration 30============ [2021-12-16 09:33:06,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 589 states and 662 transitions. [2021-12-16 09:33:06,922 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 464 [2021-12-16 09:33:06,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:33:06,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:33:06,922 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:33:06,922 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 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] [2021-12-16 09:33:06,923 INFO L791 eck$LassoCheckResult]: Stem: 63587#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 63576#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 63567#L59 assume !(0 == mp_add_~a3~0#1 % 256); 63568#L59-1 mp_add_~nb~0#1 := 4; 63868#L69 assume !(0 == mp_add_~b3~0#1 % 256); 63867#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 63866#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 63865#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 63864#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 63863#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 63862#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 63861#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 63860#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 63859#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 63858#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 63857#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 63856#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 63854#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 63855#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 63850#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 63851#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 63846#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 63847#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 63842#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 63843#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 63841#L84 assume !(0 == mp_add_~i~0#1 % 256); 63751#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 63748#L85-1 [2021-12-16 09:33:06,923 INFO L793 eck$LassoCheckResult]: Loop: 63748#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 63745#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 63738#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 63736#L90 assume !(0 == mp_add_~i~0#1 % 256); 63734#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 63732#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 63730#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 63717#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 63715#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 63713#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 63711#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 63709#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 63707#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 63705#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 63703#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 63701#L84 assume !(0 == mp_add_~i~0#1 % 256); 63699#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 63696#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 63697#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 63687#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 63688#L90 assume !(0 == mp_add_~i~0#1 % 256); 63683#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 63684#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 63677#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 63678#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 63673#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 63674#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 63669#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 63670#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 63665#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 63666#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 63656#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 63657#L84 assume !(0 == mp_add_~i~0#1 % 256); 63652#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 63653#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 63648#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 63649#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 63906#L90 assume !(0 == mp_add_~i~0#1 % 256); 63905#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 63904#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 63903#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 63902#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 63900#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 63898#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 63896#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 63894#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 63892#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 63890#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 63887#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 63877#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 63875#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 63874#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 63873#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 63872#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 63871#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 63870#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 63869#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 63839#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 63758#L84 assume !(0 == mp_add_~i~0#1 % 256); 63759#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 63748#L85-1 [2021-12-16 09:33:06,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:33:06,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1546560413, now seen corresponding path program 1 times [2021-12-16 09:33:06,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:33:06,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622352171] [2021-12-16 09:33:06,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:33:06,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:33:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:33:06,935 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:33:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:33:06,947 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:33:06,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:33:06,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1617104391, now seen corresponding path program 1 times [2021-12-16 09:33:06,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:33:06,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494667044] [2021-12-16 09:33:06,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:33:06,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:33:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:33:07,049 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-16 09:33:07,050 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:33:07,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494667044] [2021-12-16 09:33:07,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494667044] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:33:07,050 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:33:07,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 09:33:07,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513433369] [2021-12-16 09:33:07,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:33:07,050 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:33:07,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:33:07,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 09:33:07,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 09:33:07,051 INFO L87 Difference]: Start difference. First operand 589 states and 662 transitions. cyclomatic complexity: 81 Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:33:07,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:33:07,170 INFO L93 Difference]: Finished difference Result 557 states and 618 transitions. [2021-12-16 09:33:07,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 09:33:07,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 557 states and 618 transitions. [2021-12-16 09:33:07,171 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 109 [2021-12-16 09:33:07,172 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 557 states to 557 states and 618 transitions. [2021-12-16 09:33:07,172 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 557 [2021-12-16 09:33:07,172 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 557 [2021-12-16 09:33:07,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 557 states and 618 transitions. [2021-12-16 09:33:07,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:33:07,173 INFO L681 BuchiCegarLoop]: Abstraction has 557 states and 618 transitions. [2021-12-16 09:33:07,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states and 618 transitions. [2021-12-16 09:33:07,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 387. [2021-12-16 09:33:07,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 387 states have (on average 1.1111111111111112) internal successors, (430), 386 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:33:07,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 430 transitions. [2021-12-16 09:33:07,177 INFO L704 BuchiCegarLoop]: Abstraction has 387 states and 430 transitions. [2021-12-16 09:33:07,177 INFO L587 BuchiCegarLoop]: Abstraction has 387 states and 430 transitions. [2021-12-16 09:33:07,177 INFO L425 BuchiCegarLoop]: ======== Iteration 31============ [2021-12-16 09:33:07,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 387 states and 430 transitions. [2021-12-16 09:33:07,178 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 49 [2021-12-16 09:33:07,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:33:07,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:33:07,179 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 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] [2021-12-16 09:33:07,179 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:33:07,179 INFO L791 eck$LassoCheckResult]: Stem: 64740#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 64728#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 64719#L59 assume !(0 == mp_add_~a3~0#1 % 256); 64720#L59-1 mp_add_~nb~0#1 := 4; 64862#L69 assume !(0 == mp_add_~b3~0#1 % 256); 64861#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 64860#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 64859#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 64858#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 64857#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 64856#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 64855#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 64854#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 64853#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 64852#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 64851#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 64850#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 64848#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 64847#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 64846#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 64845#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 64844#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 64843#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 64841#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 64842#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 64839#L84 assume !(0 == mp_add_~i~0#1 % 256); 64838#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 64836#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 64834#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 64831#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 64829#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 64827#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 64825#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 64823#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 64821#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 64819#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 64817#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 64814#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 64812#L84 assume !(0 == mp_add_~i~0#1 % 256); 64810#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 64808#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 64806#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 64801#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 64798#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 64797#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 64796#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 64795#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 64794#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 64793#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 64792#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 64791#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 64790#L84 assume !(0 == mp_add_~i~0#1 % 256); 64789#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 64788#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 64787#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 64786#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 64784#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 64785#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 64873#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 64871#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 64869#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 64867#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 64865#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 64863#L83 [2021-12-16 09:33:07,187 INFO L793 eck$LassoCheckResult]: Loop: 64863#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 64775#L84 assume !(0 == mp_add_~i~0#1 % 256); 64778#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 64776#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 64773#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 64766#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 64767#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 64874#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 64872#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 64870#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 64868#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 64866#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 64864#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 64863#L83 [2021-12-16 09:33:07,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:33:07,188 INFO L85 PathProgramCache]: Analyzing trace with hash 660304784, now seen corresponding path program 1 times [2021-12-16 09:33:07,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:33:07,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596570570] [2021-12-16 09:33:07,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:33:07,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:33:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:33:07,279 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-16 09:33:07,279 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:33:07,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596570570] [2021-12-16 09:33:07,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596570570] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:33:07,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538037826] [2021-12-16 09:33:07,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:33:07,279 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:33:07,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:07,284 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:33:07,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2021-12-16 09:33:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:33:07,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-16 09:33:07,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:33:08,126 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 54 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-16 09:33:08,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:33:08,755 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 44 proven. 31 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-16 09:33:08,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538037826] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:33:08,755 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:33:08,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 9] total 22 [2021-12-16 09:33:08,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854401595] [2021-12-16 09:33:08,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:33:08,756 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:33:08,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:33:08,756 INFO L85 PathProgramCache]: Analyzing trace with hash 748778326, now seen corresponding path program 1 times [2021-12-16 09:33:08,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:33:08,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788637346] [2021-12-16 09:33:08,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:33:08,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:33:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:33:08,760 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:33:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:33:08,763 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:33:08,940 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:33:08,940 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:33:08,940 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:33:08,940 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:33:08,940 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-16 09:33:08,940 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:08,940 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:33:08,940 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:33:08,940 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration31_Loop [2021-12-16 09:33:08,940 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:33:08,940 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:33:08,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:33:09,572 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:33:09,572 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-16 09:33:09,572 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:09,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:09,574 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:09,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2021-12-16 09:33:09,575 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:33:09,575 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:33:09,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2021-12-16 09:33:09,769 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:09,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:09,770 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:09,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2021-12-16 09:33:09,772 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-16 09:33:09,772 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:33:09,854 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-16 09:33:09,857 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-12-16 09:33:09,857 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:33:09,857 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:33:09,857 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:33:09,857 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:33:09,857 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:33:09,858 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:09,858 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:33:09,858 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:33:09,858 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration31_Loop [2021-12-16 09:33:09,858 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:33:09,858 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:33:09,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:33:10,541 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:33:10,541 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:33:10,541 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:10,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:10,544 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:10,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2021-12-16 09:33:10,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:10,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:33:10,551 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:10,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:10,552 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-16 09:33:10,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:33:10,557 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:33:10,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:10,581 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:10,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2021-12-16 09:33:10,603 INFO L490 LassoAnalysis]: Using template '2-nested'. [2021-12-16 09:33:10,603 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:10,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:10,604 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:10,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-12-16 09:33:10,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:33:10,624 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:10,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:10,624 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-16 09:33:10,624 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-16 09:33:10,634 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:33:10,634 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:10,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2021-12-16 09:33:10,650 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:10,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2021-12-16 09:33:10,673 INFO L490 LassoAnalysis]: Using template '3-nested'. [2021-12-16 09:33:10,673 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:10,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:10,674 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:10,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:10,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:33:10,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:10,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:10,687 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-16 09:33:10,687 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:33:10,700 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2021-12-16 09:33:10,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:10,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2021-12-16 09:33:10,731 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:10,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2021-12-16 09:33:10,756 INFO L490 LassoAnalysis]: Using template '4-nested'. [2021-12-16 09:33:10,756 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:10,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:10,758 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:10,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2021-12-16 09:33:10,760 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:10,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:33:10,768 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:10,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:10,768 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-16 09:33:10,768 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-16 09:33:10,784 INFO L401 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2021-12-16 09:33:10,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:10,805 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:10,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2021-12-16 09:33:10,829 INFO L490 LassoAnalysis]: Using template '2-phase'. [2021-12-16 09:33:10,830 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:10,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:10,831 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:10,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-12-16 09:33:10,843 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:33:10,843 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-16 09:33:10,843 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:10,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:10,843 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-16 09:33:10,843 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-16 09:33:10,854 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:33:10,854 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:10,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2021-12-16 09:33:10,875 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:10,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2021-12-16 09:33:10,899 INFO L490 LassoAnalysis]: Using template '3-phase'. [2021-12-16 09:33:10,899 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:10,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:10,900 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:10,908 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:10,916 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:33:10,916 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-12-16 09:33:10,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:10,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:10,916 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-16 09:33:10,916 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:33:10,932 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2021-12-16 09:33:10,932 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:10,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2021-12-16 09:33:10,973 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:10,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2021-12-16 09:33:10,989 INFO L490 LassoAnalysis]: Using template '4-phase'. [2021-12-16 09:33:10,990 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:10,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:10,991 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:10,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2021-12-16 09:33:10,993 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:10,999 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:33:11,000 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-16 09:33:11,000 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:11,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:11,000 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-16 09:33:11,000 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-16 09:33:11,015 INFO L401 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2021-12-16 09:33:11,015 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:11,051 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:11,067 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-12-16 09:33:11,068 INFO L490 LassoAnalysis]: Using template '2-lex'. [2021-12-16 09:33:11,068 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:11,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:11,069 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:11,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2021-12-16 09:33:11,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:11,077 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:33:11,077 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-16 09:33:11,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:11,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:11,077 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-16 09:33:11,077 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:33:11,097 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2021-12-16 09:33:11,097 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:11,118 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:11,134 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-12-16 09:33:11,135 INFO L490 LassoAnalysis]: Using template '3-lex'. [2021-12-16 09:33:11,135 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:11,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:11,136 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:11,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2021-12-16 09:33:11,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:11,145 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:33:11,145 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-16 09:33:11,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:11,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:11,145 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-16 09:33:11,145 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-12-16 09:33:11,161 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2021-12-16 09:33:11,161 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:11,187 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:11,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2021-12-16 09:33:11,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:33:11,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-16 09:33:11,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2021-12-16 09:33:11,204 INFO L87 Difference]: Start difference. First operand 387 states and 430 transitions. cyclomatic complexity: 47 Second operand has 22 states, 22 states have (on average 7.454545454545454) internal successors, (164), 22 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:33:12,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:33:12,273 INFO L93 Difference]: Finished difference Result 566 states and 610 transitions. [2021-12-16 09:33:12,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-16 09:33:12,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 566 states and 610 transitions. [2021-12-16 09:33:12,275 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 111 [2021-12-16 09:33:12,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 566 states to 540 states and 577 transitions. [2021-12-16 09:33:12,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 540 [2021-12-16 09:33:12,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 540 [2021-12-16 09:33:12,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 540 states and 577 transitions. [2021-12-16 09:33:12,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:33:12,277 INFO L681 BuchiCegarLoop]: Abstraction has 540 states and 577 transitions. [2021-12-16 09:33:12,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states and 577 transitions. [2021-12-16 09:33:12,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 400. [2021-12-16 09:33:12,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 400 states have (on average 1.0775) internal successors, (431), 399 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:33:12,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 431 transitions. [2021-12-16 09:33:12,315 INFO L704 BuchiCegarLoop]: Abstraction has 400 states and 431 transitions. [2021-12-16 09:33:12,316 INFO L587 BuchiCegarLoop]: Abstraction has 400 states and 431 transitions. [2021-12-16 09:33:12,316 INFO L425 BuchiCegarLoop]: ======== Iteration 32============ [2021-12-16 09:33:12,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 400 states and 431 transitions. [2021-12-16 09:33:12,317 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 60 [2021-12-16 09:33:12,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:33:12,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:33:12,318 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:33:12,318 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:33:12,318 INFO L791 eck$LassoCheckResult]: Stem: 66127#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 66118#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 66109#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 66111#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 66113#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 66114#L59-1 mp_add_~nb~0#1 := 4; 66121#L69 assume !(0 == mp_add_~b3~0#1 % 256); 66137#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 66138#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 66254#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 66252#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 66253#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 66323#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 66119#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 66120#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 66385#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 66386#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 66409#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 66408#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 66407#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 66406#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 66405#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 66404#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 66403#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 66402#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 66401#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 66394#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 66392#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 66393#L90 assume !(0 == mp_add_~i~0#1 % 256); 66388#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 66389#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 66444#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 66445#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 66501#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 66500#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 66499#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 66498#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 66497#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 66435#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 66436#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 66431#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 66432#L90 assume !(0 == mp_add_~i~0#1 % 256); 66427#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 66428#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 66468#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 66469#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 66492#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 66490#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 66489#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 66488#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 66487#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 66486#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 66485#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 66483#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 66481#L90 assume !(0 == mp_add_~i~0#1 % 256); 66480#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 66451#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 66448#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 66449#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 66470#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 66504#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 66503#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 66502#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 66132#L102-1 [2021-12-16 09:33:12,318 INFO L793 eck$LassoCheckResult]: Loop: 66132#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 66130#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 66131#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 66411#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 66387#L90 assume !(0 == mp_add_~i~0#1 % 256); 66453#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 66105#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 66106#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 66107#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 66108#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 66122#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 66116#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 66117#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 66132#L102-1 [2021-12-16 09:33:12,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:33:12,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1520812614, now seen corresponding path program 1 times [2021-12-16 09:33:12,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:33:12,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202564541] [2021-12-16 09:33:12,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:33:12,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:33:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:33:12,337 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:33:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:33:12,358 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:33:12,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:33:12,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1233229496, now seen corresponding path program 1 times [2021-12-16 09:33:12,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:33:12,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864818402] [2021-12-16 09:33:12,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:33:12,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:33:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:33:12,362 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:33:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:33:12,364 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:33:12,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:33:12,365 INFO L85 PathProgramCache]: Analyzing trace with hash -2088026333, now seen corresponding path program 2 times [2021-12-16 09:33:12,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:33:12,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58126587] [2021-12-16 09:33:12,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:33:12,365 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:33:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:33:12,492 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 36 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:33:12,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:33:12,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58126587] [2021-12-16 09:33:12,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58126587] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:33:12,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215294304] [2021-12-16 09:33:12,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 09:33:12,492 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:33:12,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:12,494 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:33:12,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Waiting until timeout for monitored process [2021-12-16 09:33:12,529 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-16 09:33:12,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 09:33:12,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 09:33:12,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:33:13,080 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2021-12-16 09:33:13,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:33:14,997 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2021-12-16 09:33:14,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215294304] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:33:14,998 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:33:14,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 14 [2021-12-16 09:33:14,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598196691] [2021-12-16 09:33:14,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:33:15,101 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:33:15,101 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:33:15,102 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:33:15,102 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:33:15,102 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-16 09:33:15,102 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:15,102 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:33:15,102 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:33:15,102 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration32_Loop [2021-12-16 09:33:15,102 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:33:15,102 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:33:15,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:33:15,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:33:15,276 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:33:15,276 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-16 09:33:15,276 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:15,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:15,283 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:15,292 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:33:15,292 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:33:15,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2021-12-16 09:33:15,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2021-12-16 09:33:15,344 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:15,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:15,345 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:15,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2021-12-16 09:33:15,347 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-16 09:33:15,347 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:33:15,894 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-16 09:33:15,899 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-12-16 09:33:15,899 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:33:15,899 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:33:15,899 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:33:15,900 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:33:15,900 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:33:15,900 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:15,900 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:33:15,900 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:33:15,900 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration32_Loop [2021-12-16 09:33:15,900 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:33:15,900 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:33:15,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:33:15,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:33:16,084 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:33:16,085 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:33:16,085 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:16,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:16,086 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-12-16 09:33:16,086 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-12-16 09:33:16,088 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:16,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:33:16,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:16,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:16,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:16,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:33:16,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:33:16,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:16,098 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:16,114 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-12-16 09:33:16,114 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:16,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:16,115 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:16,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2021-12-16 09:33:16,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:16,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:33:16,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:16,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:16,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:16,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:33:16,124 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:33:16,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:16,128 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:16,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2021-12-16 09:33:16,144 INFO L490 LassoAnalysis]: Using template '2-nested'. [2021-12-16 09:33:16,144 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:16,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:16,145 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:16,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2021-12-16 09:33:16,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:16,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:33:16,154 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:16,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:16,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:16,154 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-16 09:33:16,156 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-16 09:33:16,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:16,159 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:16,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2021-12-16 09:33:16,176 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:16,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:16,177 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:16,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2021-12-16 09:33:16,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:16,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:33:16,185 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:16,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:16,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:16,185 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-16 09:33:16,186 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-16 09:33:16,186 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:16,188 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:16,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2021-12-16 09:33:16,204 INFO L490 LassoAnalysis]: Using template '3-nested'. [2021-12-16 09:33:16,204 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:16,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:16,205 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:16,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2021-12-16 09:33:16,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:16,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:33:16,214 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:16,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:16,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:16,214 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:33:16,217 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:33:16,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:16,221 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:16,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2021-12-16 09:33:16,238 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:16,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:16,239 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:16,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2021-12-16 09:33:16,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:16,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:33:16,248 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:16,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:16,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:16,248 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:33:16,249 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:33:16,249 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:16,252 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:16,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2021-12-16 09:33:16,268 INFO L490 LassoAnalysis]: Using template '4-nested'. [2021-12-16 09:33:16,268 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:16,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:16,270 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:16,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2021-12-16 09:33:16,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:16,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:33:16,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:16,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:16,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:16,278 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-16 09:33:16,282 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-16 09:33:16,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:16,287 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:16,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2021-12-16 09:33:16,304 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:16,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:16,304 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:16,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2021-12-16 09:33:16,307 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:16,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:33:16,313 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:16,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:16,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:16,313 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-16 09:33:16,315 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-16 09:33:16,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:16,319 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:16,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2021-12-16 09:33:16,335 INFO L490 LassoAnalysis]: Using template '2-phase'. [2021-12-16 09:33:16,335 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:16,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:16,336 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:16,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2021-12-16 09:33:16,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:16,344 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:33:16,345 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-16 09:33:16,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:16,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:16,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:16,345 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-16 09:33:16,348 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-16 09:33:16,348 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:16,353 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:16,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2021-12-16 09:33:16,369 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:16,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:16,370 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:16,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2021-12-16 09:33:16,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-12-16 09:33:16,378 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:33:16,378 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-16 09:33:16,378 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:16,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:16,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:16,379 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-16 09:33:16,380 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-16 09:33:16,380 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:16,383 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:16,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2021-12-16 09:33:16,399 INFO L490 LassoAnalysis]: Using template '3-phase'. [2021-12-16 09:33:16,399 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:16,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:16,400 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:16,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2021-12-16 09:33:16,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:16,408 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:33:16,408 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-12-16 09:33:16,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:16,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:16,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:16,408 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:33:16,412 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:33:16,412 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:16,421 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:16,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2021-12-16 09:33:16,437 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:16,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:16,438 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:16,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2021-12-16 09:33:16,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:16,446 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:33:16,447 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-12-16 09:33:16,447 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:16,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:16,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:16,447 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:33:16,449 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:33:16,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:16,453 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:16,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2021-12-16 09:33:16,471 INFO L490 LassoAnalysis]: Using template '4-phase'. [2021-12-16 09:33:16,471 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:16,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:16,472 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:16,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2021-12-16 09:33:16,474 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:16,480 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:33:16,480 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-16 09:33:16,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:16,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:16,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:16,481 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-16 09:33:16,485 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-16 09:33:16,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:16,496 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:16,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2021-12-16 09:33:16,512 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:16,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:16,513 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:16,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2021-12-16 09:33:16,515 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:16,522 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:33:16,522 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-16 09:33:16,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:16,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:16,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:16,523 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-16 09:33:16,525 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-16 09:33:16,525 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:16,531 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:16,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Forceful destruction successful, exit code 0 [2021-12-16 09:33:16,547 INFO L490 LassoAnalysis]: Using template '2-lex'. [2021-12-16 09:33:16,548 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:16,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:16,548 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:16,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2021-12-16 09:33:16,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-12-16 09:33:16,557 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:33:16,557 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-16 09:33:16,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:16,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:16,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:16,557 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:33:16,561 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:33:16,561 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:16,566 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:16,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2021-12-16 09:33:16,582 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:16,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:16,583 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:16,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2021-12-16 09:33:16,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:16,592 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:33:16,592 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-16 09:33:16,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:16,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:16,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:16,593 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:33:16,596 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:33:16,596 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:16,600 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:16,615 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-12-16 09:33:16,616 INFO L490 LassoAnalysis]: Using template '3-lex'. [2021-12-16 09:33:16,616 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:16,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:16,617 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:16,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2021-12-16 09:33:16,619 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:16,626 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:33:16,626 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-16 09:33:16,626 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:16,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:16,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:16,626 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-12-16 09:33:16,631 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:33:16,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:16,639 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:16,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2021-12-16 09:33:16,655 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:16,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:16,656 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:16,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2021-12-16 09:33:16,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-12-16 09:33:16,664 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:33:16,664 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-16 09:33:16,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:16,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:16,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:16,665 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-12-16 09:33:16,667 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:33:16,667 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:16,673 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:16,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2021-12-16 09:33:16,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:33:16,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-16 09:33:16,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-12-16 09:33:16,689 INFO L87 Difference]: Start difference. First operand 400 states and 431 transitions. cyclomatic complexity: 35 Second operand has 14 states, 14 states have (on average 9.857142857142858) internal successors, (138), 14 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:33:17,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:33:17,473 INFO L93 Difference]: Finished difference Result 408 states and 430 transitions. [2021-12-16 09:33:17,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 09:33:17,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 408 states and 430 transitions. [2021-12-16 09:33:17,474 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2021-12-16 09:33:17,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 408 states to 295 states and 308 transitions. [2021-12-16 09:33:17,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 295 [2021-12-16 09:33:17,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 295 [2021-12-16 09:33:17,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 295 states and 308 transitions. [2021-12-16 09:33:17,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:33:17,476 INFO L681 BuchiCegarLoop]: Abstraction has 295 states and 308 transitions. [2021-12-16 09:33:17,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states and 308 transitions. [2021-12-16 09:33:17,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 199. [2021-12-16 09:33:17,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 199 states have (on average 1.0603015075376885) internal successors, (211), 198 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:33:17,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 211 transitions. [2021-12-16 09:33:17,478 INFO L704 BuchiCegarLoop]: Abstraction has 199 states and 211 transitions. [2021-12-16 09:33:17,478 INFO L587 BuchiCegarLoop]: Abstraction has 199 states and 211 transitions. [2021-12-16 09:33:17,479 INFO L425 BuchiCegarLoop]: ======== Iteration 33============ [2021-12-16 09:33:17,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 199 states and 211 transitions. [2021-12-16 09:33:17,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2021-12-16 09:33:17,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:33:17,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:33:17,480 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 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-12-16 09:33:17,480 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:33:17,480 INFO L791 eck$LassoCheckResult]: Stem: 67422#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 67413#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 67405#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 67407#L61 assume !(0 == mp_add_~a2~0#1 % 256); 67408#L59-1 mp_add_~nb~0#1 := 4; 67418#L69 assume !(0 == mp_add_~b3~0#1 % 256); 67419#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 67542#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 67541#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 67540#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 67539#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 67538#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 67537#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 67536#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 67535#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 67534#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 67533#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 67532#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 67531#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 67529#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 67527#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 67525#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 67523#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 67521#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 67519#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 67497#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 67494#L84 assume !(0 == mp_add_~i~0#1 % 256); 67491#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 67488#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 67485#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 67482#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 67479#L90 assume !(0 == mp_add_~i~0#1 % 256); 67476#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 67473#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 67470#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 67467#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 67464#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 67461#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 67458#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 67449#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 67450#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 67441#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 67442#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 67436#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 67435#L90 assume !(0 == mp_add_~i~0#1 % 256); 67434#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 67432#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 67433#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 67580#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 67579#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 67578#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 67577#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 67576#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 67575#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 67574#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 67557#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 67554#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 67427#L90 assume !(0 == mp_add_~i~0#1 % 256); 67428#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 67400#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 67401#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 67402#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 67598#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 67597#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 67596#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 67595#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 67594#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 67593#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 67429#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 67415#L83-1 [2021-12-16 09:33:17,480 INFO L793 eck$LassoCheckResult]: Loop: 67415#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 67403#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 67404#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 67417#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 67411#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 67412#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 67426#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 67423#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 67424#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 67420#L84 assume !(0 == mp_add_~i~0#1 % 256); 67421#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 67425#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 67414#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 67415#L83-1 [2021-12-16 09:33:17,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:33:17,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1233883628, now seen corresponding path program 1 times [2021-12-16 09:33:17,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:33:17,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225746103] [2021-12-16 09:33:17,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:33:17,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:33:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:33:17,605 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 52 proven. 29 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-16 09:33:17,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:33:17,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225746103] [2021-12-16 09:33:17,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225746103] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:33:17,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601974090] [2021-12-16 09:33:17,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:33:17,605 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:33:17,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:17,608 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:33:17,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Waiting until timeout for monitored process [2021-12-16 09:33:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:33:17,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-16 09:33:17,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:33:18,030 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 62 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-16 09:33:18,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:33:18,180 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 64 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-16 09:33:18,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601974090] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:33:18,181 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:33:18,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 5] total 17 [2021-12-16 09:33:18,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419625193] [2021-12-16 09:33:18,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:33:18,181 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:33:18,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:33:18,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1396534456, now seen corresponding path program 2 times [2021-12-16 09:33:18,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:33:18,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884807502] [2021-12-16 09:33:18,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:33:18,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:33:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:33:18,185 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:33:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:33:18,190 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:33:18,335 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:33:18,335 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:33:18,335 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:33:18,335 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:33:18,335 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-16 09:33:18,335 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:18,335 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:33:18,335 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:33:18,335 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration33_Loop [2021-12-16 09:33:18,335 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:33:18,335 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:33:18,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:33:18,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:33:18,561 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:33:18,561 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-16 09:33:18,561 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:18,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:18,562 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:18,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2021-12-16 09:33:18,566 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:33:18,566 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:33:18,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2021-12-16 09:33:18,606 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:18,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:18,607 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:18,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2021-12-16 09:33:18,609 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-16 09:33:18,609 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:33:19,253 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-16 09:33:19,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2021-12-16 09:33:19,257 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:33:19,257 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:33:19,257 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:33:19,257 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:33:19,257 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:33:19,257 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:19,257 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:33:19,257 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:33:19,257 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration33_Loop [2021-12-16 09:33:19,257 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:33:19,257 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:33:19,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:33:19,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:33:19,447 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:33:19,447 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:33:19,447 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:19,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:19,448 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:19,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2021-12-16 09:33:19,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:19,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:33:19,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:19,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:19,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:19,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:33:19,465 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:33:19,465 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:19,467 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:19,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2021-12-16 09:33:19,483 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:19,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:19,484 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-12-16 09:33:19,484 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-12-16 09:33:19,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:19,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:33:19,492 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:19,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:19,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:19,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:33:19,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:33:19,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:19,495 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:19,510 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-12-16 09:33:19,510 INFO L490 LassoAnalysis]: Using template '2-nested'. [2021-12-16 09:33:19,510 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:19,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:19,511 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:19,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2021-12-16 09:33:19,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-12-16 09:33:19,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:33:19,519 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:19,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:19,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:19,520 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-16 09:33:19,522 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-16 09:33:19,522 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:19,525 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:19,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2021-12-16 09:33:19,541 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:19,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:19,542 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:19,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2021-12-16 09:33:19,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:19,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:33:19,550 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:19,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:19,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:19,551 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-16 09:33:19,552 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-16 09:33:19,552 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:19,554 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:19,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Ended with exit code 0 [2021-12-16 09:33:19,569 INFO L490 LassoAnalysis]: Using template '3-nested'. [2021-12-16 09:33:19,569 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:19,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:19,570 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:19,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2021-12-16 09:33:19,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-12-16 09:33:19,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:33:19,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:19,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:19,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:19,600 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:33:19,603 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:33:19,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:19,607 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:19,622 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-12-16 09:33:19,622 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:19,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:19,623 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:19,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2021-12-16 09:33:19,625 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:19,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:33:19,631 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:19,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:19,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:19,632 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:33:19,633 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:33:19,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:19,636 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:19,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2021-12-16 09:33:19,651 INFO L490 LassoAnalysis]: Using template '4-nested'. [2021-12-16 09:33:19,651 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:19,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:19,652 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:19,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2021-12-16 09:33:19,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:19,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:33:19,661 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:19,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:19,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:19,661 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-16 09:33:19,665 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-16 09:33:19,665 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:19,670 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:19,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2021-12-16 09:33:19,686 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:19,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:19,686 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:19,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2021-12-16 09:33:19,688 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:19,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:33:19,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:19,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:19,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:19,695 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-16 09:33:19,697 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-16 09:33:19,697 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:19,700 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:19,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2021-12-16 09:33:19,716 INFO L490 LassoAnalysis]: Using template '2-phase'. [2021-12-16 09:33:19,716 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:19,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:19,717 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:19,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2021-12-16 09:33:19,719 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:19,726 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:33:19,726 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-16 09:33:19,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:19,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:19,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:19,727 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-16 09:33:19,729 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-16 09:33:19,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:19,735 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:19,751 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-12-16 09:33:19,751 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:19,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:19,752 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:19,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2021-12-16 09:33:19,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:19,761 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:33:19,761 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-16 09:33:19,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:19,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:19,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:19,761 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-16 09:33:19,762 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-16 09:33:19,762 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:19,766 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:19,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2021-12-16 09:33:19,783 INFO L490 LassoAnalysis]: Using template '3-phase'. [2021-12-16 09:33:19,783 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:19,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:19,784 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:19,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2021-12-16 09:33:19,787 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:19,794 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:33:19,794 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-12-16 09:33:19,794 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:19,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:19,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:19,794 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:33:19,797 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:33:19,797 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:19,806 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:19,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Forceful destruction successful, exit code 0 [2021-12-16 09:33:19,822 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:19,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:19,823 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:19,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2021-12-16 09:33:19,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:19,833 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:33:19,833 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-12-16 09:33:19,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:19,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:19,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:19,833 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:33:19,840 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:33:19,840 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:19,845 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:19,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2021-12-16 09:33:19,861 INFO L490 LassoAnalysis]: Using template '4-phase'. [2021-12-16 09:33:19,862 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:19,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:19,863 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:19,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2021-12-16 09:33:19,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-12-16 09:33:19,876 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:33:19,876 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-16 09:33:19,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:19,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:19,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:19,876 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-16 09:33:19,880 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-16 09:33:19,880 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:19,893 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:19,909 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-12-16 09:33:19,909 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:19,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:19,911 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:19,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2021-12-16 09:33:19,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:19,920 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:33:19,920 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-16 09:33:19,920 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:19,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:19,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:19,920 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-16 09:33:19,923 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-16 09:33:19,923 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:19,932 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:19,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2021-12-16 09:33:19,947 INFO L490 LassoAnalysis]: Using template '2-lex'. [2021-12-16 09:33:19,948 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:19,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:19,949 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:19,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2021-12-16 09:33:19,951 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:19,958 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:33:19,958 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-16 09:33:19,958 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:19,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:19,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:19,958 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:33:19,961 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:33:19,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:19,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:19,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2021-12-16 09:33:19,983 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:19,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:19,983 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:19,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2021-12-16 09:33:19,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:19,992 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:33:19,992 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-16 09:33:19,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:19,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:19,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:19,992 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:33:19,994 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:33:19,994 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:19,997 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:20,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2021-12-16 09:33:20,013 INFO L490 LassoAnalysis]: Using template '3-lex'. [2021-12-16 09:33:20,013 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:20,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:20,014 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:20,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2021-12-16 09:33:20,016 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:20,023 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:33:20,023 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-16 09:33:20,023 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:20,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:20,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:20,023 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-12-16 09:33:20,028 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:33:20,028 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:20,037 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:20,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0 [2021-12-16 09:33:20,052 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:20,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:20,053 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:20,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2021-12-16 09:33:20,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:20,062 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:33:20,062 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-16 09:33:20,062 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:20,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:20,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:20,062 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-12-16 09:33:20,065 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:33:20,065 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:20,070 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:20,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2021-12-16 09:33:20,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:33:20,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-16 09:33:20,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2021-12-16 09:33:20,087 INFO L87 Difference]: Start difference. First operand 199 states and 211 transitions. cyclomatic complexity: 13 Second operand has 17 states, 17 states have (on average 9.411764705882353) internal successors, (160), 17 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:33:22,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:33:22,065 INFO L93 Difference]: Finished difference Result 421 states and 431 transitions. [2021-12-16 09:33:22,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-12-16 09:33:22,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 421 states and 431 transitions. [2021-12-16 09:33:22,067 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 39 [2021-12-16 09:33:22,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 421 states to 374 states and 383 transitions. [2021-12-16 09:33:22,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2021-12-16 09:33:22,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2021-12-16 09:33:22,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 383 transitions. [2021-12-16 09:33:22,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:33:22,068 INFO L681 BuchiCegarLoop]: Abstraction has 374 states and 383 transitions. [2021-12-16 09:33:22,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 383 transitions. [2021-12-16 09:33:22,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 199. [2021-12-16 09:33:22,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 199 states have (on average 1.0452261306532664) internal successors, (208), 198 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:33:22,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 208 transitions. [2021-12-16 09:33:22,071 INFO L704 BuchiCegarLoop]: Abstraction has 199 states and 208 transitions. [2021-12-16 09:33:22,072 INFO L587 BuchiCegarLoop]: Abstraction has 199 states and 208 transitions. [2021-12-16 09:33:22,072 INFO L425 BuchiCegarLoop]: ======== Iteration 34============ [2021-12-16 09:33:22,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 199 states and 208 transitions. [2021-12-16 09:33:22,072 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2021-12-16 09:33:22,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:33:22,072 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:33:22,073 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:33:22,073 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:33:22,073 INFO L791 eck$LassoCheckResult]: Stem: 68574#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 68565#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~ret2#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 68557#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 68559#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 68561#L63 assume !(0 == mp_add_~a1~0#1 % 256); 68562#L59-1 mp_add_~nb~0#1 := 4; 68630#L69 assume !(0 == mp_add_~b3~0#1 % 256); 68629#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 68628#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 68627#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 68626#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 68625#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 68624#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 68623#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 68622#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 68621#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 68620#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 68619#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 68618#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 68617#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 68616#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 68615#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 68614#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 68613#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 68612#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 68611#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 68610#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 68609#L84 assume !(0 == mp_add_~i~0#1 % 256); 68608#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 68607#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 68606#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 68605#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 68604#L90 assume !(0 == mp_add_~i~0#1 % 256); 68603#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 68602#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 68601#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 68600#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 68599#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 68598#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 68597#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 68596#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 68595#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 68594#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 68593#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 68591#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 68590#L90 assume !(0 == mp_add_~i~0#1 % 256); 68588#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 68589#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 68729#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 68727#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 68725#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 68723#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 68721#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 68719#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 68717#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 68715#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 68712#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 68713#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 68579#L90 assume !(0 == mp_add_~i~0#1 % 256); 68580#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 68551#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 68552#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 68742#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 68741#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 68740#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 68739#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 68738#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 68737#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 68736#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 68581#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 68567#L83-1 [2021-12-16 09:33:22,073 INFO L793 eck$LassoCheckResult]: Loop: 68567#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 68553#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 68554#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 68569#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 68563#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 68564#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 68578#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 68575#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 68576#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 68572#L84 assume !(0 == mp_add_~i~0#1 % 256); 68573#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 68577#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 68566#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 68567#L83-1 [2021-12-16 09:33:22,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:33:22,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1829265491, now seen corresponding path program 1 times [2021-12-16 09:33:22,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:33:22,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966475097] [2021-12-16 09:33:22,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:33:22,074 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:33:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:33:22,230 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 67 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-16 09:33:22,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:33:22,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966475097] [2021-12-16 09:33:22,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966475097] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:33:22,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137653965] [2021-12-16 09:33:22,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:33:22,231 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:33:22,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:22,236 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:33:22,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (143)] Waiting until timeout for monitored process [2021-12-16 09:33:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:33:22,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-16 09:33:22,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:33:22,791 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 67 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-16 09:33:22,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:33:23,252 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 24 proven. 54 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-16 09:33:23,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137653965] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:33:23,252 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:33:23,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 10] total 17 [2021-12-16 09:33:23,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121148945] [2021-12-16 09:33:23,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:33:23,253 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:33:23,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:33:23,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1396534456, now seen corresponding path program 3 times [2021-12-16 09:33:23,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:33:23,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201163685] [2021-12-16 09:33:23,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:33:23,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:33:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:33:23,257 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:33:23,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:33:23,264 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:33:23,412 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:33:23,412 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:33:23,412 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:33:23,412 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:33:23,412 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-16 09:33:23,412 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:23,412 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:33:23,412 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:33:23,412 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration34_Loop [2021-12-16 09:33:23,412 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:33:23,412 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:33:23,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:33:23,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:33:23,633 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:33:23,633 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-16 09:33:23,634 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:23,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:23,635 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:23,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2021-12-16 09:33:23,637 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:33:23,637 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:33:23,653 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:33:23,653 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~carry~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=0} Honda state: {ULTIMATE.start_mp_add_~carry~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-16 09:33:23,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Forceful destruction successful, exit code 0 [2021-12-16 09:33:23,671 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:23,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:23,672 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:23,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2021-12-16 09:33:23,674 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:33:23,674 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:33:23,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2021-12-16 09:33:23,730 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:23,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:23,731 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:23,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2021-12-16 09:33:23,733 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-16 09:33:23,733 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:33:24,156 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-16 09:33:24,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Forceful destruction successful, exit code 0 [2021-12-16 09:33:24,161 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:33:24,161 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:33:24,161 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:33:24,161 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:33:24,161 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:33:24,161 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:24,161 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:33:24,161 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:33:24,161 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration34_Loop [2021-12-16 09:33:24,161 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:33:24,161 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:33:24,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:33:24,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:33:24,404 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:33:24,405 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:33:24,405 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:24,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:24,406 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-12-16 09:33:24,406 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-12-16 09:33:24,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:24,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:33:24,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:24,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:24,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:24,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:33:24,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:33:24,415 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:24,416 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:24,432 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-12-16 09:33:24,432 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:24,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:24,433 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-12-16 09:33:24,434 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-12-16 09:33:24,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:24,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:33:24,441 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:24,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:24,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:24,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:33:24,444 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:33:24,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:24,448 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:24,463 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-12-16 09:33:24,463 INFO L490 LassoAnalysis]: Using template '2-nested'. [2021-12-16 09:33:24,463 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:24,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:24,464 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-12-16 09:33:24,465 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-12-16 09:33:24,466 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:24,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:33:24,472 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:24,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:24,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:24,473 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-16 09:33:24,474 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-16 09:33:24,474 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:24,476 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:24,492 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-12-16 09:33:24,492 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:24,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:24,493 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-12-16 09:33:24,493 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-12-16 09:33:24,495 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:24,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:33:24,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:24,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:24,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:24,501 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-16 09:33:24,504 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-16 09:33:24,504 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:24,507 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:24,523 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-12-16 09:33:24,523 INFO L490 LassoAnalysis]: Using template '3-nested'. [2021-12-16 09:33:24,523 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:24,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:24,524 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-12-16 09:33:24,525 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-12-16 09:33:24,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:24,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:33:24,532 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:24,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:24,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:24,532 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:33:24,534 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:33:24,534 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:24,536 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:24,552 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-12-16 09:33:24,552 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:24,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:24,554 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-12-16 09:33:24,554 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-12-16 09:33:24,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:24,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:33:24,562 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:24,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:24,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:24,562 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:33:24,566 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:33:24,566 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:24,570 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:24,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Forceful destruction successful, exit code 0 [2021-12-16 09:33:24,585 INFO L490 LassoAnalysis]: Using template '4-nested'. [2021-12-16 09:33:24,585 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:24,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:24,586 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-12-16 09:33:24,587 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-12-16 09:33:24,589 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:24,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:33:24,595 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:24,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:24,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:24,596 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-16 09:33:24,599 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-16 09:33:24,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:24,602 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:24,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0 [2021-12-16 09:33:24,618 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:24,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:24,619 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-12-16 09:33:24,619 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-12-16 09:33:24,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:24,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:33:24,627 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:24,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:24,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:24,627 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-16 09:33:24,632 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-16 09:33:24,632 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:24,656 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:24,680 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-12-16 09:33:24,680 INFO L490 LassoAnalysis]: Using template '2-phase'. [2021-12-16 09:33:24,680 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:24,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:24,681 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-12-16 09:33:24,683 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-12-16 09:33:24,684 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:24,691 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:33:24,691 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-16 09:33:24,691 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:24,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:24,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:24,691 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-16 09:33:24,693 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-16 09:33:24,693 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:24,711 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:24,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Forceful destruction successful, exit code 0 [2021-12-16 09:33:24,733 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:24,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:24,734 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-12-16 09:33:24,739 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:24,746 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:33:24,746 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-16 09:33:24,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:24,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:24,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:24,747 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-16 09:33:24,747 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-12-16 09:33:24,750 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-16 09:33:24,750 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:24,765 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:24,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Forceful destruction successful, exit code 0 [2021-12-16 09:33:24,789 INFO L490 LassoAnalysis]: Using template '3-phase'. [2021-12-16 09:33:24,789 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:24,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:24,790 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-12-16 09:33:24,791 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-12-16 09:33:24,792 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:24,799 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:33:24,799 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-12-16 09:33:24,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:24,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:24,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:24,800 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:33:24,802 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:33:24,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:24,818 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:24,841 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-12-16 09:33:24,842 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:24,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:24,843 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-12-16 09:33:24,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:24,855 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:33:24,855 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-12-16 09:33:24,856 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:24,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:24,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:24,856 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:33:24,860 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:33:24,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:24,871 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-12-16 09:33:24,879 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:24,903 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-12-16 09:33:24,903 INFO L490 LassoAnalysis]: Using template '4-phase'. [2021-12-16 09:33:24,903 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:24,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:24,905 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-12-16 09:33:24,907 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:24,916 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:33:24,916 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-16 09:33:24,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:24,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:24,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:24,916 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-16 09:33:24,919 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-16 09:33:24,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:24,931 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-12-16 09:33:24,935 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:24,959 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-12-16 09:33:24,960 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:24,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:24,962 INFO L229 MonitoredProcess]: Starting monitored process 160 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:24,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2021-12-16 09:33:24,964 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:24,972 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:33:24,972 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-16 09:33:24,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:24,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:24,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:24,972 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-16 09:33:24,978 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-16 09:33:24,978 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:24,999 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:25,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Forceful destruction successful, exit code 0 [2021-12-16 09:33:25,025 INFO L490 LassoAnalysis]: Using template '2-lex'. [2021-12-16 09:33:25,025 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:25,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:25,026 INFO L229 MonitoredProcess]: Starting monitored process 161 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:25,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2021-12-16 09:33:25,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:25,035 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:33:25,036 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-16 09:33:25,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:25,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:25,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:25,036 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:33:25,038 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:33:25,038 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:25,056 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:25,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Forceful destruction successful, exit code 0 [2021-12-16 09:33:25,078 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:25,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:25,079 INFO L229 MonitoredProcess]: Starting monitored process 162 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:25,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2021-12-16 09:33:25,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:25,087 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:33:25,087 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-16 09:33:25,088 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:25,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:25,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:25,088 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-16 09:33:25,091 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:33:25,091 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:25,096 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:25,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Forceful destruction successful, exit code 0 [2021-12-16 09:33:25,112 INFO L490 LassoAnalysis]: Using template '3-lex'. [2021-12-16 09:33:25,113 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:25,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:25,113 INFO L229 MonitoredProcess]: Starting monitored process 163 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:25,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2021-12-16 09:33:25,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:25,121 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:33:25,122 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-16 09:33:25,122 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:25,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:25,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:25,122 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-12-16 09:33:25,127 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:33:25,127 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:25,135 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:25,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Forceful destruction successful, exit code 0 [2021-12-16 09:33:25,151 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:33:25,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:33:25,152 INFO L229 MonitoredProcess]: Starting monitored process 164 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:33:25,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2021-12-16 09:33:25,154 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 09:33:25,160 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-16 09:33:25,160 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-16 09:33:25,160 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:33:25,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:33:25,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:33:25,160 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-12-16 09:33:25,165 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:33:25,165 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:33:25,174 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:33:25,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Ended with exit code 0 [2021-12-16 09:33:25,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:33:25,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-16 09:33:25,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2021-12-16 09:33:25,190 INFO L87 Difference]: Start difference. First operand 199 states and 208 transitions. cyclomatic complexity: 10 Second operand has 17 states, 17 states have (on average 8.764705882352942) internal successors, (149), 17 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)