./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.ufo.BOUNDED-10.pals.c -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 795faee1020e2b189fc46722dee9a2a95190a8c5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 17:01:52,704 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 17:01:52,706 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 17:01:52,740 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 17:01:52,741 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 17:01:52,743 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 17:01:52,744 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 17:01:52,748 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 17:01:52,750 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 17:01:52,753 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 17:01:52,754 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 17:01:52,757 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 17:01:52,757 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 17:01:52,759 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 17:01:52,760 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 17:01:52,762 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 17:01:52,763 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 17:01:52,764 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 17:01:52,766 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 17:01:52,770 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 17:01:52,771 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 17:01:52,771 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 17:01:52,772 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 17:01:52,773 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 17:01:52,778 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 17:01:52,778 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 17:01:52,778 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 17:01:52,779 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 17:01:52,780 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 17:01:52,780 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 17:01:52,780 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 17:01:52,781 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 17:01:52,782 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 17:01:52,784 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 17:01:52,784 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 17:01:52,785 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 17:01:52,785 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 17:01:52,785 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 17:01:52,785 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 17:01:52,786 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 17:01:52,787 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 17:01:52,788 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 17:01:52,816 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 17:01:52,817 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 17:01:52,817 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 17:01:52,817 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 17:01:52,819 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 17:01:52,819 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 17:01:52,819 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 17:01:52,819 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 17:01:52,819 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 17:01:52,820 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 17:01:52,820 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 17:01:52,820 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 17:01:52,820 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 17:01:52,821 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 17:01:52,821 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 17:01:52,821 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 17:01:52,821 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 17:01:52,821 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 17:01:52,821 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 17:01:52,822 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 17:01:52,822 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 17:01:52,822 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 17:01:52,822 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 17:01:52,822 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 17:01:52,822 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 17:01:52,822 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 17:01:52,822 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 17:01:52,823 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 17:01:52,823 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 17:01:52,823 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 17:01:52,823 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 17:01:52,823 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 17:01:52,824 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 17:01:52,824 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 -> 795faee1020e2b189fc46722dee9a2a95190a8c5 [2021-08-27 17:01:53,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 17:01:53,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 17:01:53,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 17:01:53,084 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 17:01:53,084 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 17:01:53,085 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.ufo.BOUNDED-10.pals.c [2021-08-27 17:01:53,150 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c580f20d6/637d5759162b4fdc9ea2e5e605c14fa7/FLAG1679efc58 [2021-08-27 17:01:53,497 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 17:01:53,497 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.5.ufo.BOUNDED-10.pals.c [2021-08-27 17:01:53,505 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c580f20d6/637d5759162b4fdc9ea2e5e605c14fa7/FLAG1679efc58 [2021-08-27 17:01:53,910 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c580f20d6/637d5759162b4fdc9ea2e5e605c14fa7 [2021-08-27 17:01:53,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 17:01:53,913 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 17:01:53,921 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 17:01:53,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 17:01:53,923 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 17:01:53,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:01:53" (1/1) ... [2021-08-27 17:01:53,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a9f52c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:01:53, skipping insertion in model container [2021-08-27 17:01:53,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:01:53" (1/1) ... [2021-08-27 17:01:53,929 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 17:01:53,948 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 17:01:54,071 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.5.ufo.BOUNDED-10.pals.c[11336,11349] [2021-08-27 17:01:54,071 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 17:01:54,077 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 17:01:54,138 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.5.ufo.BOUNDED-10.pals.c[11336,11349] [2021-08-27 17:01:54,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 17:01:54,149 INFO L208 MainTranslator]: Completed translation [2021-08-27 17:01:54,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:01:54 WrapperNode [2021-08-27 17:01:54,150 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 17:01:54,151 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 17:01:54,151 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 17:01:54,151 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 17:01:54,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:01:54" (1/1) ... [2021-08-27 17:01:54,161 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:01:54" (1/1) ... [2021-08-27 17:01:54,186 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 17:01:54,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 17:01:54,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 17:01:54,189 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 17:01:54,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:01:54" (1/1) ... [2021-08-27 17:01:54,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:01:54" (1/1) ... [2021-08-27 17:01:54,207 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:01:54" (1/1) ... [2021-08-27 17:01:54,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:01:54" (1/1) ... [2021-08-27 17:01:54,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:01:54" (1/1) ... [2021-08-27 17:01:54,229 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:01:54" (1/1) ... [2021-08-27 17:01:54,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:01:54" (1/1) ... [2021-08-27 17:01:54,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 17:01:54,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 17:01:54,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 17:01:54,237 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 17:01:54,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:01:54" (1/1) ... [2021-08-27 17:01:54,249 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:01:54,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:01:54,261 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:01:54,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-08-27 17:01:54,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 17:01:54,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 17:01:54,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 17:01:54,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 17:01:54,720 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 17:01:54,720 INFO L299 CfgBuilder]: Removed 23 assume(true) statements. [2021-08-27 17:01:54,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:01:54 BoogieIcfgContainer [2021-08-27 17:01:54,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 17:01:54,722 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 17:01:54,722 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 17:01:54,725 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 17:01:54,725 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:01:54,725 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 05:01:53" (1/3) ... [2021-08-27 17:01:54,726 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5aaac7b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 05:01:54, skipping insertion in model container [2021-08-27 17:01:54,726 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:01:54,726 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:01:54" (2/3) ... [2021-08-27 17:01:54,727 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5aaac7b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 05:01:54, skipping insertion in model container [2021-08-27 17:01:54,727 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:01:54,727 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:01:54" (3/3) ... [2021-08-27 17:01:54,728 INFO L389 chiAutomizerObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c [2021-08-27 17:01:54,764 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 17:01:54,765 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 17:01:54,765 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 17:01:54,765 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 17:01:54,765 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 17:01:54,765 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 17:01:54,765 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 17:01:54,765 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 17:01:54,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 92 states, 91 states have (on average 1.7142857142857142) internal successors, (156), 91 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:01:54,804 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2021-08-27 17:01:54,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:01:54,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:01:54,809 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:01:54,809 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:01:54,809 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 17:01:54,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 92 states, 91 states have (on average 1.7142857142857142) internal successors, (156), 91 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:01:54,813 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2021-08-27 17:01:54,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:01:54,814 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:01:54,815 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:01:54,815 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:01:54,819 INFO L791 eck$LassoCheckResult]: Stem: 75#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(33);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 62#L-1true havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~ret33, main_#t~ret34, main_#t~post35, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~id2~0 := main_#t~nondet17;havoc main_#t~nondet17;~st2~0 := main_#t~nondet18;havoc main_#t~nondet18;~send2~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~id4~0 := main_#t~nondet25;havoc main_#t~nondet25;~st4~0 := main_#t~nondet26;havoc main_#t~nondet26;~send4~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode4~0 := main_#t~nondet28;havoc main_#t~nondet28;~id5~0 := main_#t~nondet29;havoc main_#t~nondet29;~st5~0 := main_#t~nondet30;havoc main_#t~nondet30;~send5~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode5~0 := main_#t~nondet32;havoc main_#t~nondet32;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 10#L198true assume !(0 == ~r1~0);init_~tmp~0 := 0; 39#L198-1true init_#res := init_~tmp~0; 7#L323true main_#t~ret33 := init_#res;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 68#L22true assume !(0 == assume_abort_if_not_~cond); 46#L21true ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 22#L395-2true [2021-08-27 17:01:54,822 INFO L793 eck$LassoCheckResult]: Loop: 22#L395-2true assume !!(main_~i2~0 < 10);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 12#L71true assume !(0 != ~mode1~0 % 256); 53#L85true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite7 := ~send1~0; 8#L85-2true ~p1_new~0 := (if node1_#t~ite7 % 256 <= 127 then node1_#t~ite7 % 256 else node1_#t~ite7 % 256 - 256);havoc node1_#t~ite7;~mode1~0 := 1; 86#L71-2true havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 15#L97true assume !(0 != ~mode2~0 % 256); 4#L110true assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite8 := ~send2~0; 67#L110-2true ~p2_new~0 := (if node2_#t~ite8 % 256 <= 127 then node2_#t~ite8 % 256 else node2_#t~ite8 % 256 - 256);havoc node2_#t~ite8;~mode2~0 := 1; 81#L97-2true havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 72#L122true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 33#L125true assume !(node3_~m3~0 != ~nomsg~0); 34#L125-1true ~mode3~0 := 0; 61#L122-2true havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 73#L147true assume !(0 != ~mode4~0 % 256); 37#L160true assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite10 := ~send4~0; 23#L160-2true ~p4_new~0 := (if node4_#t~ite10 % 256 <= 127 then node4_#t~ite10 % 256 else node4_#t~ite10 % 256 - 256);havoc node4_#t~ite10;~mode4~0 := 1; 29#L147-2true havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 64#L172true assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 9#L175true assume !(node5_~m5~0 != ~nomsg~0); 80#L175-1true ~mode5~0 := 0; 77#L172-2true ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 19#L331true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 43#L331-1true check_#res := check_~tmp~1; 5#L351true main_#t~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 58#L425true assume !(0 == assert_~arg % 256); 54#L420true main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 22#L395-2true [2021-08-27 17:01:54,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:01:54,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1978587388, now seen corresponding path program 1 times [2021-08-27 17:01:54,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:01:54,841 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342834908] [2021-08-27 17:01:54,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:01:54,842 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:01:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:01:55,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:01:55,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:01:55,023 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342834908] [2021-08-27 17:01:55,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342834908] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:01:55,024 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:01:55,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 17:01:55,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941657753] [2021-08-27 17:01:55,038 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:01:55,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:01:55,041 INFO L82 PathProgramCache]: Analyzing trace with hash -182127972, now seen corresponding path program 1 times [2021-08-27 17:01:55,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:01:55,041 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608044079] [2021-08-27 17:01:55,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:01:55,042 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:01:55,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:01:55,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:01:55,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:01:55,190 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608044079] [2021-08-27 17:01:55,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608044079] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:01:55,190 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:01:55,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 17:01:55,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539412113] [2021-08-27 17:01:55,191 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 17:01:55,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:01:55,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 17:01:55,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 17:01:55,217 INFO L87 Difference]: Start difference. First operand has 92 states, 91 states have (on average 1.7142857142857142) internal successors, (156), 91 states have internal predecessors, (156), 0 states have call successors, (0), 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 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:01:55,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:01:55,309 INFO L93 Difference]: Finished difference Result 95 states and 155 transitions. [2021-08-27 17:01:55,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 17:01:55,310 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 155 transitions. [2021-08-27 17:01:55,313 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2021-08-27 17:01:55,316 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 87 states and 117 transitions. [2021-08-27 17:01:55,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 [2021-08-27 17:01:55,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 87 [2021-08-27 17:01:55,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 117 transitions. [2021-08-27 17:01:55,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:01:55,318 INFO L681 BuchiCegarLoop]: Abstraction has 87 states and 117 transitions. [2021-08-27 17:01:55,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 117 transitions. [2021-08-27 17:01:55,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-08-27 17:01:55,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 86 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:01:55,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 117 transitions. [2021-08-27 17:01:55,344 INFO L704 BuchiCegarLoop]: Abstraction has 87 states and 117 transitions. [2021-08-27 17:01:55,344 INFO L587 BuchiCegarLoop]: Abstraction has 87 states and 117 transitions. [2021-08-27 17:01:55,344 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 17:01:55,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 117 transitions. [2021-08-27 17:01:55,349 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2021-08-27 17:01:55,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:01:55,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:01:55,352 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:01:55,353 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:01:55,353 INFO L791 eck$LassoCheckResult]: Stem: 285#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(33);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 280#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~ret33, main_#t~ret34, main_#t~post35, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~id2~0 := main_#t~nondet17;havoc main_#t~nondet17;~st2~0 := main_#t~nondet18;havoc main_#t~nondet18;~send2~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~id4~0 := main_#t~nondet25;havoc main_#t~nondet25;~st4~0 := main_#t~nondet26;havoc main_#t~nondet26;~send4~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode4~0 := main_#t~nondet28;havoc main_#t~nondet28;~id5~0 := main_#t~nondet29;havoc main_#t~nondet29;~st5~0 := main_#t~nondet30;havoc main_#t~nondet30;~send5~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode5~0 := main_#t~nondet32;havoc main_#t~nondet32;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 219#L198 assume 0 == ~r1~0; 220#L199 assume ~id1~0 >= 0; 272#L200 assume 0 == ~st1~0; 273#L201 assume ~send1~0 == ~id1~0; 256#L202 assume 0 == ~mode1~0 % 256; 257#L203 assume ~id2~0 >= 0; 266#L204 assume 0 == ~st2~0; 234#L205 assume ~send2~0 == ~id2~0; 235#L206 assume 0 == ~mode2~0 % 256; 221#L207 assume ~id3~0 >= 0; 222#L208 assume 0 == ~st3~0; 278#L209 assume ~send3~0 == ~id3~0; 236#L210 assume 0 == ~mode3~0 % 256; 237#L211 assume ~id4~0 >= 0; 223#L212 assume 0 == ~st4~0; 224#L213 assume ~send4~0 == ~id4~0; 288#L214 assume 0 == ~mode4~0 % 256; 289#L215 assume ~id5~0 >= 0; 275#L216 assume 0 == ~st5~0; 261#L217 assume ~send5~0 == ~id5~0; 262#L218 assume 0 == ~mode5~0 % 256; 281#L219 assume ~id1~0 != ~id2~0; 291#L220 assume ~id1~0 != ~id3~0; 253#L221 assume ~id1~0 != ~id4~0; 251#L222 assume ~id1~0 != ~id5~0; 252#L223 assume ~id2~0 != ~id3~0; 246#L224 assume ~id2~0 != ~id4~0; 247#L225 assume ~id2~0 != ~id5~0; 241#L226 assume ~id3~0 != ~id4~0; 242#L227 assume ~id3~0 != ~id5~0; 258#L228 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 259#L198-1 init_#res := init_~tmp~0; 212#L323 main_#t~ret33 := init_#res;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 213#L22 assume !(0 == assume_abort_if_not_~cond); 268#L21 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 245#L395-2 [2021-08-27 17:01:55,353 INFO L793 eck$LassoCheckResult]: Loop: 245#L395-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 225#L71 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 226#L75 assume !(node1_~m1~0 != ~nomsg~0); 267#L75-1 ~mode1~0 := 0; 215#L71-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 230#L97 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 231#L100 assume !(node2_~m2~0 != ~nomsg~0); 228#L100-1 ~mode2~0 := 0; 229#L97-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 284#L122 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 260#L125 assume !(node3_~m3~0 != ~nomsg~0); 210#L125-1 ~mode3~0 := 0; 263#L122-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 279#L147 assume !(0 != ~mode4~0 % 256); 264#L160 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite10 := ~send4~0; 248#L160-2 ~p4_new~0 := (if node4_#t~ite10 % 256 <= 127 then node4_#t~ite10 % 256 else node4_#t~ite10 % 256 - 256);havoc node4_#t~ite10;~mode4~0 := 1; 233#L147-2 havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 254#L172 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 216#L175 assume !(node5_~m5~0 != ~nomsg~0); 217#L175-1 ~mode5~0 := 0; 283#L172-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 238#L331 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 239#L331-1 check_#res := check_~tmp~1; 207#L351 main_#t~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 208#L425 assume !(0 == assert_~arg % 256); 274#L420 main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 245#L395-2 [2021-08-27 17:01:55,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:01:55,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1992034189, now seen corresponding path program 1 times [2021-08-27 17:01:55,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:01:55,354 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231022785] [2021-08-27 17:01:55,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:01:55,355 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:01:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:01:55,384 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:01:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:01:55,435 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:01:55,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:01:55,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1791481680, now seen corresponding path program 1 times [2021-08-27 17:01:55,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:01:55,436 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021118744] [2021-08-27 17:01:55,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:01:55,437 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:01:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:01:55,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:01:55,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:01:55,513 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021118744] [2021-08-27 17:01:55,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021118744] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:01:55,513 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:01:55,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 17:01:55,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753833672] [2021-08-27 17:01:55,521 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 17:01:55,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:01:55,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 17:01:55,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 17:01:55,522 INFO L87 Difference]: Start difference. First operand 87 states and 117 transitions. cyclomatic complexity: 31 Second operand has 5 states, 5 states have (on average 5.2) 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-08-27 17:01:55,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:01:55,553 INFO L93 Difference]: Finished difference Result 90 states and 119 transitions. [2021-08-27 17:01:55,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 17:01:55,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 119 transitions. [2021-08-27 17:01:55,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2021-08-27 17:01:55,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 87 states and 114 transitions. [2021-08-27 17:01:55,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 [2021-08-27 17:01:55,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 87 [2021-08-27 17:01:55,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 114 transitions. [2021-08-27 17:01:55,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:01:55,557 INFO L681 BuchiCegarLoop]: Abstraction has 87 states and 114 transitions. [2021-08-27 17:01:55,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 114 transitions. [2021-08-27 17:01:55,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-08-27 17:01:55,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 87 states have (on average 1.3103448275862069) internal successors, (114), 86 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:01:55,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 114 transitions. [2021-08-27 17:01:55,573 INFO L704 BuchiCegarLoop]: Abstraction has 87 states and 114 transitions. [2021-08-27 17:01:55,573 INFO L587 BuchiCegarLoop]: Abstraction has 87 states and 114 transitions. [2021-08-27 17:01:55,573 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 17:01:55,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 114 transitions. [2021-08-27 17:01:55,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2021-08-27 17:01:55,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:01:55,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:01:55,575 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:01:55,575 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:01:55,575 INFO L791 eck$LassoCheckResult]: Stem: 474#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(33);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 469#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~ret33, main_#t~ret34, main_#t~post35, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~id2~0 := main_#t~nondet17;havoc main_#t~nondet17;~st2~0 := main_#t~nondet18;havoc main_#t~nondet18;~send2~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~id4~0 := main_#t~nondet25;havoc main_#t~nondet25;~st4~0 := main_#t~nondet26;havoc main_#t~nondet26;~send4~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode4~0 := main_#t~nondet28;havoc main_#t~nondet28;~id5~0 := main_#t~nondet29;havoc main_#t~nondet29;~st5~0 := main_#t~nondet30;havoc main_#t~nondet30;~send5~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode5~0 := main_#t~nondet32;havoc main_#t~nondet32;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 408#L198 assume 0 == ~r1~0; 409#L199 assume ~id1~0 >= 0; 461#L200 assume 0 == ~st1~0; 462#L201 assume ~send1~0 == ~id1~0; 444#L202 assume 0 == ~mode1~0 % 256; 445#L203 assume ~id2~0 >= 0; 455#L204 assume 0 == ~st2~0; 421#L205 assume ~send2~0 == ~id2~0; 422#L206 assume 0 == ~mode2~0 % 256; 410#L207 assume ~id3~0 >= 0; 411#L208 assume 0 == ~st3~0; 467#L209 assume ~send3~0 == ~id3~0; 425#L210 assume 0 == ~mode3~0 % 256; 426#L211 assume ~id4~0 >= 0; 412#L212 assume 0 == ~st4~0; 413#L213 assume ~send4~0 == ~id4~0; 477#L214 assume 0 == ~mode4~0 % 256; 478#L215 assume ~id5~0 >= 0; 464#L216 assume 0 == ~st5~0; 450#L217 assume ~send5~0 == ~id5~0; 451#L218 assume 0 == ~mode5~0 % 256; 470#L219 assume ~id1~0 != ~id2~0; 480#L220 assume ~id1~0 != ~id3~0; 442#L221 assume ~id1~0 != ~id4~0; 440#L222 assume ~id1~0 != ~id5~0; 441#L223 assume ~id2~0 != ~id3~0; 435#L224 assume ~id2~0 != ~id4~0; 436#L225 assume ~id2~0 != ~id5~0; 429#L226 assume ~id3~0 != ~id4~0; 430#L227 assume ~id3~0 != ~id5~0; 447#L228 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 448#L198-1 init_#res := init_~tmp~0; 401#L323 main_#t~ret33 := init_#res;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 402#L22 assume !(0 == assume_abort_if_not_~cond); 457#L21 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 434#L395-2 [2021-08-27 17:01:55,576 INFO L793 eck$LassoCheckResult]: Loop: 434#L395-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 414#L71 assume !(0 != ~mode1~0 % 256); 416#L85 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite7 := ~send1~0; 403#L85-2 ~p1_new~0 := (if node1_#t~ite7 % 256 <= 127 then node1_#t~ite7 % 256 else node1_#t~ite7 % 256 - 256);havoc node1_#t~ite7;~mode1~0 := 1; 404#L71-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 419#L97 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 420#L100 assume !(node2_~m2~0 != ~nomsg~0); 417#L100-1 ~mode2~0 := 0; 418#L97-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 473#L122 assume !(0 != ~mode3~0 % 256); 465#L135 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite9 := ~send3~0; 466#L135-2 ~p3_new~0 := (if node3_#t~ite9 % 256 <= 127 then node3_#t~ite9 % 256 else node3_#t~ite9 % 256 - 256);havoc node3_#t~ite9;~mode3~0 := 1; 452#L122-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 468#L147 assume !(0 != ~mode4~0 % 256); 454#L160 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite10 := ~send4~0; 437#L160-2 ~p4_new~0 := (if node4_#t~ite10 % 256 <= 127 then node4_#t~ite10 % 256 else node4_#t~ite10 % 256 - 256);havoc node4_#t~ite10;~mode4~0 := 1; 424#L147-2 havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 443#L172 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 405#L175 assume !(node5_~m5~0 != ~nomsg~0); 406#L175-1 ~mode5~0 := 0; 472#L172-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 427#L331 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 428#L332 assume ~r1~0 >= 5; 431#L336 assume ~r1~0 < 5;check_~tmp~1 := 1; 432#L331-1 check_#res := check_~tmp~1; 394#L351 main_#t~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 395#L425 assume !(0 == assert_~arg % 256); 463#L420 main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 434#L395-2 [2021-08-27 17:01:55,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:01:55,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1992034189, now seen corresponding path program 2 times [2021-08-27 17:01:55,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:01:55,576 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695410797] [2021-08-27 17:01:55,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:01:55,577 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:01:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:01:55,610 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:01:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:01:55,648 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:01:55,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:01:55,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1202452748, now seen corresponding path program 1 times [2021-08-27 17:01:55,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:01:55,652 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874635105] [2021-08-27 17:01:55,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:01:55,652 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:01:55,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:01:55,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:01:55,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:01:55,703 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874635105] [2021-08-27 17:01:55,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874635105] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:01:55,704 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:01:55,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 17:01:55,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064065740] [2021-08-27 17:01:55,705 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 17:01:55,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:01:55,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 17:01:55,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 17:01:55,707 INFO L87 Difference]: Start difference. First operand 87 states and 114 transitions. cyclomatic complexity: 28 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:01:55,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:01:55,731 INFO L93 Difference]: Finished difference Result 131 states and 180 transitions. [2021-08-27 17:01:55,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 17:01:55,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 180 transitions. [2021-08-27 17:01:55,735 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2021-08-27 17:01:55,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 131 states and 180 transitions. [2021-08-27 17:01:55,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 131 [2021-08-27 17:01:55,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 131 [2021-08-27 17:01:55,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 180 transitions. [2021-08-27 17:01:55,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:01:55,744 INFO L681 BuchiCegarLoop]: Abstraction has 131 states and 180 transitions. [2021-08-27 17:01:55,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 180 transitions. [2021-08-27 17:01:55,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-08-27 17:01:55,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 131 states have (on average 1.3740458015267176) internal successors, (180), 130 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:01:55,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 180 transitions. [2021-08-27 17:01:55,754 INFO L704 BuchiCegarLoop]: Abstraction has 131 states and 180 transitions. [2021-08-27 17:01:55,754 INFO L587 BuchiCegarLoop]: Abstraction has 131 states and 180 transitions. [2021-08-27 17:01:55,754 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 17:01:55,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 180 transitions. [2021-08-27 17:01:55,755 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2021-08-27 17:01:55,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:01:55,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:01:55,758 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:01:55,758 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:01:55,758 INFO L791 eck$LassoCheckResult]: Stem: 701#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(33);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 696#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~ret33, main_#t~ret34, main_#t~post35, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~id2~0 := main_#t~nondet17;havoc main_#t~nondet17;~st2~0 := main_#t~nondet18;havoc main_#t~nondet18;~send2~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~id4~0 := main_#t~nondet25;havoc main_#t~nondet25;~st4~0 := main_#t~nondet26;havoc main_#t~nondet26;~send4~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode4~0 := main_#t~nondet28;havoc main_#t~nondet28;~id5~0 := main_#t~nondet29;havoc main_#t~nondet29;~st5~0 := main_#t~nondet30;havoc main_#t~nondet30;~send5~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode5~0 := main_#t~nondet32;havoc main_#t~nondet32;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 632#L198 assume 0 == ~r1~0; 633#L199 assume ~id1~0 >= 0; 688#L200 assume 0 == ~st1~0; 689#L201 assume ~send1~0 == ~id1~0; 668#L202 assume 0 == ~mode1~0 % 256; 669#L203 assume ~id2~0 >= 0; 680#L204 assume 0 == ~st2~0; 647#L205 assume ~send2~0 == ~id2~0; 648#L206 assume 0 == ~mode2~0 % 256; 634#L207 assume ~id3~0 >= 0; 635#L208 assume 0 == ~st3~0; 694#L209 assume ~send3~0 == ~id3~0; 649#L210 assume 0 == ~mode3~0 % 256; 650#L211 assume ~id4~0 >= 0; 641#L212 assume 0 == ~st4~0; 642#L213 assume ~send4~0 == ~id4~0; 704#L214 assume 0 == ~mode4~0 % 256; 705#L215 assume ~id5~0 >= 0; 693#L216 assume 0 == ~st5~0; 674#L217 assume ~send5~0 == ~id5~0; 675#L218 assume 0 == ~mode5~0 % 256; 697#L219 assume ~id1~0 != ~id2~0; 707#L220 assume ~id1~0 != ~id3~0; 665#L221 assume ~id1~0 != ~id4~0; 663#L222 assume ~id1~0 != ~id5~0; 664#L223 assume ~id2~0 != ~id3~0; 658#L224 assume ~id2~0 != ~id4~0; 659#L225 assume ~id2~0 != ~id5~0; 653#L226 assume ~id3~0 != ~id4~0; 654#L227 assume ~id3~0 != ~id5~0; 670#L228 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 671#L198-1 init_#res := init_~tmp~0; 625#L323 main_#t~ret33 := init_#res;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 626#L22 assume !(0 == assume_abort_if_not_~cond); 683#L21 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 684#L395-2 [2021-08-27 17:01:55,758 INFO L793 eck$LassoCheckResult]: Loop: 684#L395-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 744#L71 assume !(0 != ~mode1~0 % 256); 743#L85 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite7 := ~send1~0; 742#L85-2 ~p1_new~0 := (if node1_#t~ite7 % 256 <= 127 then node1_#t~ite7 % 256 else node1_#t~ite7 % 256 - 256);havoc node1_#t~ite7;~mode1~0 := 1; 682#L71-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 741#L97 assume !(0 != ~mode2~0 % 256); 737#L110 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite8 := ~send2~0; 736#L110-2 ~p2_new~0 := (if node2_#t~ite8 % 256 <= 127 then node2_#t~ite8 % 256 else node2_#t~ite8 % 256 - 256);havoc node2_#t~ite8;~mode2~0 := 1; 734#L97-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 733#L122 assume !(0 != ~mode3~0 % 256); 729#L135 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite9 := ~send3~0; 728#L135-2 ~p3_new~0 := (if node3_#t~ite9 % 256 <= 127 then node3_#t~ite9 % 256 else node3_#t~ite9 % 256 - 256);havoc node3_#t~ite9;~mode3~0 := 1; 726#L122-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 725#L147 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 722#L150 assume !(node4_~m4~0 != ~nomsg~0); 720#L150-1 ~mode4~0 := 0; 718#L147-2 havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 717#L172 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 714#L175 assume !(node5_~m5~0 != ~nomsg~0); 712#L175-1 ~mode5~0 := 0; 710#L172-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 709#L331 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 708#L332 assume !(~r1~0 >= 5); 677#L335 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; 678#L336 assume ~r1~0 < 5;check_~tmp~1 := 1; 748#L331-1 check_#res := check_~tmp~1; 747#L351 main_#t~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 746#L425 assume !(0 == assert_~arg % 256); 745#L420 main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 684#L395-2 [2021-08-27 17:01:55,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:01:55,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1992034189, now seen corresponding path program 3 times [2021-08-27 17:01:55,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:01:55,759 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602767263] [2021-08-27 17:01:55,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:01:55,759 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:01:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:01:55,784 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:01:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:01:55,812 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:01:55,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:01:55,814 INFO L82 PathProgramCache]: Analyzing trace with hash 2096394309, now seen corresponding path program 1 times [2021-08-27 17:01:55,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:01:55,814 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031239519] [2021-08-27 17:01:55,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:01:55,814 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:01:55,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:01:55,826 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:01:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:01:55,835 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:01:55,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:01:55,836 INFO L82 PathProgramCache]: Analyzing trace with hash 297264403, now seen corresponding path program 1 times [2021-08-27 17:01:55,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:01:55,836 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991084623] [2021-08-27 17:01:55,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:01:55,836 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:01:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:01:55,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:01:55,885 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:01:55,886 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991084623] [2021-08-27 17:01:55,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991084623] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:01:55,886 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:01:55,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 17:01:55,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702205545] [2021-08-27 17:01:56,916 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:01:56,918 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:01:56,918 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:01:56,918 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:01:56,919 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-27 17:01:56,919 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:01:56,919 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:01:56,919 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:01:56,921 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.5.ufo.BOUNDED-10.pals.c_Iteration4_Loop [2021-08-27 17:01:56,921 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:01:56,921 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:01:56,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-08-27 17:01:56,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:01:56,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:01:56,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:01:56,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:01:56,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:01:56,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:01:56,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:01:56,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:01:56,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:01:56,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:01:56,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:01:56,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:01:56,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:01:56,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:01:56,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:01:56,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:01:56,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:01:56,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:01:57,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-08-27 17:01:57,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:01:57,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:01:57,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:01:57,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:01:57,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:01:57,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:01:57,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:01:57,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:01:57,617 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2021-08-27 17:02:33,448 WARN L207 SmtUtils]: Spent 35.61 s on a formula simplification. DAG size of input: 634 DAG size of output: 186 [2021-08-27 17:02:33,544 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 17:02:33,544 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-27 17:02:33,546 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:02:33,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:02:33,556 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-08-27 17:02:33,560 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-08-27 17:02:33,561 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 17:02:33,561 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 17:02:33,590 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-08-27 17:02:33,590 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:02:33,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:02:33,591 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-08-27 17:02:33,596 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-08-27 17:02:33,596 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-27 17:02:33,596 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 17:02:33,695 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-27 17:02:33,700 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-08-27 17:02:33,701 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:02:33,701 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:02:33,701 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:02:33,701 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:02:33,701 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 17:02:33,701 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:02:33,701 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:02:33,701 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:02:33,701 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.5.ufo.BOUNDED-10.pals.c_Iteration4_Loop [2021-08-27 17:02:33,701 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:02:33,701 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:02:33,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:02:33,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:02:33,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:02:33,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:02:33,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:02:33,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:02:33,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:02:33,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:02:33,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:02:33,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:02:33,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:02:33,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:02:33,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:02:33,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:02:33,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:02:33,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:02:33,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:02:33,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-08-27 17:02:33,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:02:33,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:02:33,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:02:33,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:02:33,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:02:33,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:02:33,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:02:33,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:02:33,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:02:33,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:02:34,306 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2021-08-27 17:03:08,772 WARN L207 SmtUtils]: Spent 34.33 s on a formula simplification. DAG size of input: 634 DAG size of output: 186 [2021-08-27 17:03:08,841 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 17:03:08,844 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 17:03:08,845 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:03:08,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:03:08,862 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-08-27 17:03:08,863 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-08-27 17:03:08,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:03:08,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:03:08,871 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:03:08,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:03:08,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:03:08,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:03:08,873 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:03:08,873 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:03:08,882 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:03:08,900 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-08-27 17:03:08,901 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:03:08,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:03:08,902 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-08-27 17:03:08,903 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-08-27 17:03:08,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:03:08,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:03:08,909 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:03:08,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:03:08,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:03:08,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:03:08,911 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:03:08,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:03:08,932 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:03:08,953 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-08-27 17:03:08,953 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:03:08,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:03:08,955 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-08-27 17:03:08,955 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-08-27 17:03:08,957 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:03:08,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:03:08,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:03:08,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:03:08,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:03:08,966 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:03:08,966 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:03:08,980 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:03:08,998 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-08-27 17:03:08,998 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:03:08,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:03:08,999 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-08-27 17:03:09,001 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-08-27 17:03:09,002 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:03:09,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:03:09,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:03:09,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:03:09,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:03:09,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:03:09,010 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:03:09,010 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:03:09,032 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:03:09,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-08-27 17:03:09,054 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:03:09,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:03:09,055 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-08-27 17:03:09,056 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-08-27 17:03:09,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:03:09,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:03:09,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:03:09,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:03:09,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:03:09,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:03:09,064 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:03:09,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:03:09,080 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:03:09,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-08-27 17:03:09,099 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:03:09,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:03:09,100 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-08-27 17:03:09,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-08-27 17:03:09,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:03:09,113 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:03:09,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:03:09,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:03:09,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:03:09,114 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:03:09,114 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:03:09,118 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-08-27 17:03:09,132 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:03:09,151 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-08-27 17:03:09,152 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:03:09,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:03:09,153 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-08-27 17:03:09,154 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-08-27 17:03:09,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:03:09,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:03:09,162 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:03:09,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:03:09,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:03:09,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:03:09,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:03:09,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:03:09,180 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:03:09,201 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-08-27 17:03:09,202 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:03:09,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:03:09,202 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:03:09,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-08-27 17:03:09,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:03:09,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:03:09,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:03:09,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:03:09,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:03:09,218 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:03:09,218 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:03:09,232 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:03:09,251 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-08-27 17:03:09,251 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:03:09,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:03:09,261 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:03:09,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:03:09,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:03:09,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:03:09,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:03:09,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:03:09,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:03:09,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:03:09,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:03:09,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-08-27 17:03:09,292 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:03:09,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-08-27 17:03:09,311 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:03:09,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:03:09,312 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:03:09,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-08-27 17:03:09,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:03:09,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:03:09,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:03:09,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:03:09,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:03:09,323 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:03:09,323 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:03:09,339 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:03:09,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-08-27 17:03:09,359 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:03:09,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:03:09,360 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:03:09,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-08-27 17:03:09,362 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:03:09,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:03:09,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:03:09,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:03:09,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:03:09,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:03:09,369 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:03:09,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:03:09,381 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:03:09,405 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-08-27 17:03:09,405 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:03:09,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:03:09,406 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:03:09,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:03:09,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:03:09,437 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:03:09,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:03:09,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:03:09,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:03:09,438 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:03:09,438 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:03:09,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-08-27 17:03:09,440 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:03:09,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2021-08-27 17:03:09,460 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:03:09,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:03:09,461 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:03:09,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-08-27 17:03:09,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:03:09,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:03:09,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:03:09,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:03:09,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:03:09,471 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:03:09,471 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:03:09,473 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:03:09,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-08-27 17:03:09,489 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:03:09,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:03:09,489 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:03:09,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-08-27 17:03:09,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:03:09,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:03:09,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:03:09,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:03:09,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:03:09,498 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:03:09,498 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:03:09,520 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:03:09,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-08-27 17:03:09,538 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:03:09,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:03:09,541 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:03:09,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-08-27 17:03:09,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:03:09,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:03:09,551 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:03:09,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:03:09,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:03:09,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:03:09,552 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:03:09,552 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:03:09,560 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:03:09,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-08-27 17:03:09,576 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:03:09,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:03:09,576 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:03:09,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-08-27 17:03:09,578 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:03:09,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:03:09,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:03:09,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:03:09,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:03:09,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:03:09,584 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:03:09,584 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:03:09,586 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 17:03:09,590 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-27 17:03:09,590 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-27 17:03:09,591 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:03:09,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:03:09,601 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:03:09,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-08-27 17:03:09,605 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 17:03:09,608 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-27 17:03:09,608 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 17:03:09,609 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 19 Supporting invariants [] [2021-08-27 17:03:09,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-08-27 17:03:09,628 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-27 17:03:09,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:03:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:03:09,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 17:03:09,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:03:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:03:09,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 17:03:09,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:03:10,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:03:10,013 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-08-27 17:03:10,014 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 131 states and 180 transitions. cyclomatic complexity: 50 Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:03:10,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-08-27 17:03:10,070 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 131 states and 180 transitions. cyclomatic complexity: 50. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 224 states and 323 transitions. Complement of second has 4 states. [2021-08-27 17:03:10,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-08-27 17:03:10,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:03:10,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2021-08-27 17:03:10,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 114 transitions. Stem has 37 letters. Loop has 29 letters. [2021-08-27 17:03:10,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:03:10,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 114 transitions. Stem has 66 letters. Loop has 29 letters. [2021-08-27 17:03:10,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:03:10,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 114 transitions. Stem has 37 letters. Loop has 58 letters. [2021-08-27 17:03:10,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:03:10,078 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 224 states and 323 transitions. [2021-08-27 17:03:10,081 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 17:03:10,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 224 states to 0 states and 0 transitions. [2021-08-27 17:03:10,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-27 17:03:10,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-27 17:03:10,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-27 17:03:10,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:03:10,082 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 17:03:10,082 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 17:03:10,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:03:10,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 17:03:10,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 17:03:10,083 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:03:10,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:03:10,083 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-08-27 17:03:10,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-27 17:03:10,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2021-08-27 17:03:10,083 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 17:03:10,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2021-08-27 17:03:10,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-27 17:03:10,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-27 17:03:10,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-27 17:03:10,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:03:10,084 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 17:03:10,084 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 17:03:10,084 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 17:03:10,084 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 17:03:10,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-08-27 17:03:10,084 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 17:03:10,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-08-27 17:03:10,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 05:03:10 BoogieIcfgContainer [2021-08-27 17:03:10,088 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 17:03:10,089 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 17:03:10,089 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 17:03:10,089 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 17:03:10,089 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:01:54" (3/4) ... [2021-08-27 17:03:10,091 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 17:03:10,091 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 17:03:10,092 INFO L168 Benchmark]: Toolchain (without parser) took 76179.00 ms. Allocated memory was 58.7 MB in the beginning and 211.8 MB in the end (delta: 153.1 MB). Free memory was 36.8 MB in the beginning and 173.6 MB in the end (delta: -136.8 MB). Peak memory consumption was 15.6 MB. Max. memory is 16.1 GB. [2021-08-27 17:03:10,093 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 58.7 MB. Free memory was 40.8 MB in the beginning and 40.8 MB in the end (delta: 39.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 17:03:10,093 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.57 ms. Allocated memory is still 58.7 MB. Free memory was 36.7 MB in the beginning and 39.4 MB in the end (delta: -2.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-08-27 17:03:10,096 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.81 ms. Allocated memory is still 58.7 MB. Free memory was 39.4 MB in the beginning and 37.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 17:03:10,098 INFO L168 Benchmark]: Boogie Preprocessor took 47.46 ms. Allocated memory is still 58.7 MB. Free memory was 37.1 MB in the beginning and 35.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 17:03:10,098 INFO L168 Benchmark]: RCFGBuilder took 485.27 ms. Allocated memory was 58.7 MB in the beginning and 79.7 MB in the end (delta: 21.0 MB). Free memory was 35.0 MB in the beginning and 53.8 MB in the end (delta: -18.8 MB). Peak memory consumption was 23.5 MB. Max. memory is 16.1 GB. [2021-08-27 17:03:10,098 INFO L168 Benchmark]: BuchiAutomizer took 75366.01 ms. Allocated memory was 79.7 MB in the beginning and 211.8 MB in the end (delta: 132.1 MB). Free memory was 53.8 MB in the beginning and 173.6 MB in the end (delta: -119.8 MB). Peak memory consumption was 11.5 MB. Max. memory is 16.1 GB. [2021-08-27 17:03:10,098 INFO L168 Benchmark]: Witness Printer took 2.54 ms. Allocated memory is still 211.8 MB. Free memory is still 173.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 17:03:10,101 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 58.7 MB. Free memory was 40.8 MB in the beginning and 40.8 MB in the end (delta: 39.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 229.57 ms. Allocated memory is still 58.7 MB. Free memory was 36.7 MB in the beginning and 39.4 MB in the end (delta: -2.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 35.81 ms. Allocated memory is still 58.7 MB. Free memory was 39.4 MB in the beginning and 37.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 47.46 ms. Allocated memory is still 58.7 MB. Free memory was 37.1 MB in the beginning and 35.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 485.27 ms. Allocated memory was 58.7 MB in the beginning and 79.7 MB in the end (delta: 21.0 MB). Free memory was 35.0 MB in the beginning and 53.8 MB in the end (delta: -18.8 MB). Peak memory consumption was 23.5 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 75366.01 ms. Allocated memory was 79.7 MB in the beginning and 211.8 MB in the end (delta: 132.1 MB). Free memory was 53.8 MB in the beginning and 173.6 MB in the end (delta: -119.8 MB). Peak memory consumption was 11.5 MB. Max. memory is 16.1 GB. * Witness Printer took 2.54 ms. Allocated memory is still 211.8 MB. Free memory is still 173.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 19 + -2 * i2 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 75.3s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 74.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 32.8ms AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 131 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 550 SDtfs, 258 SDslu, 937 SDs, 0 SdLazy, 36 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 59.3ms Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital216 mio100 ax127 hnf107 lsp70 ukn65 mio100 lsp100 div167 bol100 ite100 ukn100 eq168 hnf68 smp100 dnf40036 smp11 tf100 neg98 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-08-27 17:03:10,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...