./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.6.ufo.BOUNDED-12.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5fbdf5bf 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.6.ufo.BOUNDED-12.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 dc122f1c236e4c4319c2b7131e81ba348e188116 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-31 04:58:02,695 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-31 04:58:02,699 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-31 04:58:02,740 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-31 04:58:02,741 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-31 04:58:02,745 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-31 04:58:02,746 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-31 04:58:02,752 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-31 04:58:02,755 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-31 04:58:02,760 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-31 04:58:02,761 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-31 04:58:02,766 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-31 04:58:02,766 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-31 04:58:02,769 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-31 04:58:02,772 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-31 04:58:02,776 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-31 04:58:02,777 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-31 04:58:02,778 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-31 04:58:02,781 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-31 04:58:02,787 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-31 04:58:02,789 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-31 04:58:02,790 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-31 04:58:02,792 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-31 04:58:02,794 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-31 04:58:02,800 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-31 04:58:02,801 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-31 04:58:02,801 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-31 04:58:02,803 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-31 04:58:02,803 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-31 04:58:02,804 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-31 04:58:02,804 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-31 04:58:02,804 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-31 04:58:02,805 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-31 04:58:02,806 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-31 04:58:02,808 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-31 04:58:02,808 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-31 04:58:02,809 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-31 04:58:02,809 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-31 04:58:02,809 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-31 04:58:02,811 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-31 04:58:02,812 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-31 04:58:02,813 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-31 04:58:02,855 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-31 04:58:02,855 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-31 04:58:02,856 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-31 04:58:02,857 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-31 04:58:02,859 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-31 04:58:02,859 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-31 04:58:02,860 INFO L138 SettingsManager]: * Use SBE=true [2021-08-31 04:58:02,860 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-31 04:58:02,860 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-31 04:58:02,860 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-31 04:58:02,861 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-31 04:58:02,861 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-31 04:58:02,861 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-31 04:58:02,862 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-31 04:58:02,862 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-31 04:58:02,862 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-31 04:58:02,862 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-31 04:58:02,863 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-31 04:58:02,863 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-31 04:58:02,877 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-31 04:58:02,877 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-31 04:58:02,877 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-31 04:58:02,877 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-31 04:58:02,878 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-31 04:58:02,878 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-31 04:58:02,878 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-31 04:58:02,878 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-31 04:58:02,878 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-31 04:58:02,879 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-31 04:58:02,879 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-31 04:58:02,879 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-31 04:58:02,879 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-31 04:58:02,880 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-31 04:58:02,881 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 -> dc122f1c236e4c4319c2b7131e81ba348e188116 [2021-08-31 04:58:03,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-31 04:58:03,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-31 04:58:03,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-31 04:58:03,283 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-31 04:58:03,289 INFO L275 PluginConnector]: CDTParser initialized [2021-08-31 04:58:03,291 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.6.ufo.BOUNDED-12.pals.c [2021-08-31 04:58:03,361 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed0ae9b2c/aeb71220187845fc9b064a67773aafe3/FLAGdf1e00b65 [2021-08-31 04:58:03,933 INFO L306 CDTParser]: Found 1 translation units. [2021-08-31 04:58:03,934 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.6.ufo.BOUNDED-12.pals.c [2021-08-31 04:58:03,944 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed0ae9b2c/aeb71220187845fc9b064a67773aafe3/FLAGdf1e00b65 [2021-08-31 04:58:04,281 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed0ae9b2c/aeb71220187845fc9b064a67773aafe3 [2021-08-31 04:58:04,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-31 04:58:04,286 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-31 04:58:04,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-31 04:58:04,290 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-31 04:58:04,294 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-31 04:58:04,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 04:58:04" (1/1) ... [2021-08-31 04:58:04,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76537690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:58:04, skipping insertion in model container [2021-08-31 04:58:04,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 04:58:04" (1/1) ... [2021-08-31 04:58:04,302 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-31 04:58:04,336 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-31 04:58:04,518 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.6.ufo.BOUNDED-12.pals.c[15192,15205] [2021-08-31 04:58:04,519 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 04:58:04,536 INFO L203 MainTranslator]: Completed pre-run [2021-08-31 04:58:04,644 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.6.ufo.BOUNDED-12.pals.c[15192,15205] [2021-08-31 04:58:04,652 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 04:58:04,667 INFO L208 MainTranslator]: Completed translation [2021-08-31 04:58:04,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:58:04 WrapperNode [2021-08-31 04:58:04,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-31 04:58:04,672 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-31 04:58:04,672 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-31 04:58:04,673 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-31 04:58:04,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:58:04" (1/1) ... [2021-08-31 04:58:04,702 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:58:04" (1/1) ... [2021-08-31 04:58:04,742 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-31 04:58:04,745 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-31 04:58:04,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-31 04:58:04,745 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-31 04:58:04,755 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:58:04" (1/1) ... [2021-08-31 04:58:04,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:58:04" (1/1) ... [2021-08-31 04:58:04,768 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:58:04" (1/1) ... [2021-08-31 04:58:04,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:58:04" (1/1) ... [2021-08-31 04:58:04,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:58:04" (1/1) ... [2021-08-31 04:58:04,795 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:58:04" (1/1) ... [2021-08-31 04:58:04,800 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:58:04" (1/1) ... [2021-08-31 04:58:04,807 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-31 04:58:04,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-31 04:58:04,811 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-31 04:58:04,811 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-31 04:58:04,813 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:58:04" (1/1) ... [2021-08-31 04:58:04,819 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:04,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:04,854 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-31 04:58:04,879 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-31 04:58:04,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-31 04:58:04,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-31 04:58:04,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-31 04:58:04,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-31 04:58:05,263 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-31 04:58:05,264 INFO L299 CfgBuilder]: Removed 25 assume(true) statements. [2021-08-31 04:58:05,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 04:58:05 BoogieIcfgContainer [2021-08-31 04:58:05,266 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-31 04:58:05,267 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-31 04:58:05,267 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-31 04:58:05,278 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-31 04:58:05,279 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 04:58:05,279 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 31.08 04:58:04" (1/3) ... [2021-08-31 04:58:05,280 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5efd2a77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 04:58:05, skipping insertion in model container [2021-08-31 04:58:05,281 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 04:58:05,281 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:58:04" (2/3) ... [2021-08-31 04:58:05,281 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5efd2a77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 04:58:05, skipping insertion in model container [2021-08-31 04:58:05,281 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 04:58:05,281 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 04:58:05" (3/3) ... [2021-08-31 04:58:05,283 INFO L389 chiAutomizerObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals.c [2021-08-31 04:58:05,329 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-31 04:58:05,329 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-31 04:58:05,330 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-31 04:58:05,330 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-31 04:58:05,330 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-31 04:58:05,330 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-31 04:58:05,330 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-31 04:58:05,330 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-31 04:58:05,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 109 states, 108 states have (on average 1.7314814814814814) internal successors, (187), 108 states have internal predecessors, (187), 0 states have call successors, (0), 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-31 04:58:05,387 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2021-08-31 04:58:05,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:58:05,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:58:05,397 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:58:05,397 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, 1] [2021-08-31 04:58:05,398 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-31 04:58:05,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 109 states, 108 states have (on average 1.7314814814814814) internal successors, (187), 108 states have internal predecessors, (187), 0 states have call successors, (0), 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-31 04:58:05,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2021-08-31 04:58:05,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:58:05,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:58:05,412 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:58:05,413 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, 1] [2021-08-31 04:58:05,420 INFO L791 eck$LassoCheckResult]: Stem: 93#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 41#L-1true havoc main_#res;havoc 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~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~ret38, main_#t~ret39, main_#t~post40, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~id1~0 := main_#t~nondet14;havoc main_#t~nondet14;~st1~0 := main_#t~nondet15;havoc main_#t~nondet15;~send1~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~id3~0 := main_#t~nondet22;havoc main_#t~nondet22;~st3~0 := main_#t~nondet23;havoc main_#t~nondet23;~send3~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode3~0 := main_#t~nondet25;havoc main_#t~nondet25;~id4~0 := main_#t~nondet26;havoc main_#t~nondet26;~st4~0 := main_#t~nondet27;havoc main_#t~nondet27;~send4~0 := main_#t~nondet28;havoc main_#t~nondet28;~mode4~0 := main_#t~nondet29;havoc main_#t~nondet29;~id5~0 := main_#t~nondet30;havoc main_#t~nondet30;~st5~0 := main_#t~nondet31;havoc main_#t~nondet31;~send5~0 := main_#t~nondet32;havoc main_#t~nondet32;~mode5~0 := main_#t~nondet33;havoc main_#t~nondet33;~id6~0 := main_#t~nondet34;havoc main_#t~nondet34;~st6~0 := main_#t~nondet35;havoc main_#t~nondet35;~send6~0 := main_#t~nondet36;havoc main_#t~nondet36;~mode6~0 := main_#t~nondet37;havoc main_#t~nondet37;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 64#L230true assume !(0 == ~r1~0);init_~tmp~0 := 0; 104#L230-1true init_#res := init_~tmp~0; 70#L391true main_#t~ret38 := init_#res;main_~i2~0 := main_#t~ret38;havoc main_#t~ret38;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; 43#L22true assume !(0 == assume_abort_if_not_~cond); 78#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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 40#L469-2true [2021-08-31 04:58:05,425 INFO L793 eck$LassoCheckResult]: Loop: 40#L469-2true assume !!(main_~i2~0 < 12);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 24#L78true 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 73#L82true assume !(node1_~m1~0 != ~nomsg~0); 10#L82-1true ~mode1~0 := 0; 44#L78-2true havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 19#L104true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 99#L107true assume !(node2_~m2~0 != ~nomsg~0); 94#L107-1true ~mode2~0 := 0; 107#L104-2true havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 91#L129true assume !(0 != ~mode3~0 % 256); 80#L142true assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite9 := ~send3~0; 77#L142-2true ~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; 12#L129-2true havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 74#L154true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 8#L157true assume !(node4_~m4~0 != ~nomsg~0); 17#L157-1true ~mode4~0 := 0; 108#L154-2true havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 97#L179true assume !(0 != ~mode5~0 % 256); 76#L192true assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite11 := ~send5~0; 75#L192-2true ~p5_new~0 := (if node5_#t~ite11 % 256 <= 127 then node5_#t~ite11 % 256 else node5_#t~ite11 % 256 - 256);havoc node5_#t~ite11;~mode5~0 := 1; 26#L179-2true havoc node6_#t~ite12, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 87#L204true assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 63#L207true assume !(node6_~m6~0 != ~nomsg~0); 39#L207-1true ~mode6~0 := 0; 79#L204-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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 59#L399true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 95#L399-1true check_#res := check_~tmp~1; 5#L419true main_#t~ret39 := check_#res;main_~c1~0 := main_#t~ret39;havoc main_#t~ret39;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 42#L502true assume !(0 == assert_~arg % 256); 96#L497true main_#t~post40 := main_~i2~0;main_~i2~0 := 1 + main_#t~post40;havoc main_#t~post40; 40#L469-2true [2021-08-31 04:58:05,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:58:05,433 INFO L82 PathProgramCache]: Analyzing trace with hash 2030119858, now seen corresponding path program 1 times [2021-08-31 04:58:05,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:58:05,449 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203144067] [2021-08-31 04:58:05,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:58:05,450 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:58:05,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:58:05,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:58:05,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:58:05,694 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203144067] [2021-08-31 04:58:05,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203144067] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:58:05,695 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:58:05,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-31 04:58:05,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499385316] [2021-08-31 04:58:05,702 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 04:58:05,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:58:05,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1889928533, now seen corresponding path program 1 times [2021-08-31 04:58:05,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:58:05,703 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075679702] [2021-08-31 04:58:05,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:58:05,704 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:58:05,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:58:05,877 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-31 04:58:05,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:58:05,879 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075679702] [2021-08-31 04:58:05,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075679702] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:58:05,879 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:58:05,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-31 04:58:05,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123844912] [2021-08-31 04:58:05,881 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:58:05,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:58:05,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-31 04:58:05,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-31 04:58:05,919 INFO L87 Difference]: Start difference. First operand has 109 states, 108 states have (on average 1.7314814814814814) internal successors, (187), 108 states have internal predecessors, (187), 0 states have call successors, (0), 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-31 04:58:06,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:58:06,502 INFO L93 Difference]: Finished difference Result 112 states and 186 transitions. [2021-08-31 04:58:06,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-31 04:58:06,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 186 transitions. [2021-08-31 04:58:06,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2021-08-31 04:58:06,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 104 states and 139 transitions. [2021-08-31 04:58:06,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2021-08-31 04:58:06,529 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2021-08-31 04:58:06,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 139 transitions. [2021-08-31 04:58:06,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:58:06,532 INFO L681 BuchiCegarLoop]: Abstraction has 104 states and 139 transitions. [2021-08-31 04:58:06,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 139 transitions. [2021-08-31 04:58:06,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-08-31 04:58:06,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.3365384615384615) internal successors, (139), 103 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 04:58:06,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 139 transitions. [2021-08-31 04:58:06,571 INFO L704 BuchiCegarLoop]: Abstraction has 104 states and 139 transitions. [2021-08-31 04:58:06,571 INFO L587 BuchiCegarLoop]: Abstraction has 104 states and 139 transitions. [2021-08-31 04:58:06,571 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-31 04:58:06,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 139 transitions. [2021-08-31 04:58:06,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2021-08-31 04:58:06,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:58:06,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:58:06,580 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 04:58:06,580 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, 1] [2021-08-31 04:58:06,583 INFO L791 eck$LassoCheckResult]: Stem: 341#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 295#L-1 havoc main_#res;havoc 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~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~ret38, main_#t~ret39, main_#t~post40, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~id1~0 := main_#t~nondet14;havoc main_#t~nondet14;~st1~0 := main_#t~nondet15;havoc main_#t~nondet15;~send1~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~id3~0 := main_#t~nondet22;havoc main_#t~nondet22;~st3~0 := main_#t~nondet23;havoc main_#t~nondet23;~send3~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode3~0 := main_#t~nondet25;havoc main_#t~nondet25;~id4~0 := main_#t~nondet26;havoc main_#t~nondet26;~st4~0 := main_#t~nondet27;havoc main_#t~nondet27;~send4~0 := main_#t~nondet28;havoc main_#t~nondet28;~mode4~0 := main_#t~nondet29;havoc main_#t~nondet29;~id5~0 := main_#t~nondet30;havoc main_#t~nondet30;~st5~0 := main_#t~nondet31;havoc main_#t~nondet31;~send5~0 := main_#t~nondet32;havoc main_#t~nondet32;~mode5~0 := main_#t~nondet33;havoc main_#t~nondet33;~id6~0 := main_#t~nondet34;havoc main_#t~nondet34;~st6~0 := main_#t~nondet35;havoc main_#t~nondet35;~send6~0 := main_#t~nondet36;havoc main_#t~nondet36;~mode6~0 := main_#t~nondet37;havoc main_#t~nondet37;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 296#L230 assume 0 == ~r1~0; 325#L231 assume ~id1~0 >= 0; 327#L232 assume 0 == ~st1~0; 316#L233 assume ~send1~0 == ~id1~0; 317#L234 assume 0 == ~mode1~0 % 256; 322#L235 assume ~id2~0 >= 0; 309#L236 assume 0 == ~st2~0; 310#L237 assume ~send2~0 == ~id2~0; 283#L238 assume 0 == ~mode2~0 % 256; 284#L239 assume ~id3~0 >= 0; 281#L240 assume 0 == ~st3~0; 282#L241 assume ~send3~0 == ~id3~0; 286#L242 assume 0 == ~mode3~0 % 256; 326#L243 assume ~id4~0 >= 0; 250#L244 assume 0 == ~st4~0; 251#L245 assume ~send4~0 == ~id4~0; 285#L246 assume 0 == ~mode4~0 % 256; 315#L247 assume ~id5~0 >= 0; 336#L248 assume 0 == ~st5~0; 243#L249 assume ~send5~0 == ~id5~0; 244#L250 assume 0 == ~mode5~0 % 256; 328#L251 assume ~id6~0 >= 0; 300#L252 assume 0 == ~st6~0; 301#L253 assume ~send6~0 == ~id6~0; 306#L254 assume 0 == ~mode6~0 % 256; 261#L255 assume ~id1~0 != ~id2~0; 262#L256 assume ~id1~0 != ~id3~0; 302#L257 assume ~id1~0 != ~id4~0; 290#L258 assume ~id1~0 != ~id5~0; 291#L259 assume ~id1~0 != ~id6~0; 318#L260 assume ~id2~0 != ~id3~0; 319#L261 assume ~id2~0 != ~id4~0; 307#L262 assume ~id2~0 != ~id5~0; 308#L263 assume ~id2~0 != ~id6~0; 311#L264 assume ~id3~0 != ~id4~0; 312#L265 assume ~id3~0 != ~id5~0; 253#L266 assume ~id3~0 != ~id6~0; 254#L267 assume ~id4~0 != ~id5~0; 269#L268 assume ~id4~0 != ~id6~0; 270#L269 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 314#L230-1 init_#res := init_~tmp~0; 329#L391 main_#t~ret38 := init_#res;main_~i2~0 := main_#t~ret38;havoc main_#t~ret38;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; 298#L22 assume !(0 == assume_abort_if_not_~cond); 299#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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 294#L469-2 [2021-08-31 04:58:06,583 INFO L793 eck$LassoCheckResult]: Loop: 294#L469-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 273#L78 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 274#L82 assume !(node1_~m1~0 != ~nomsg~0); 240#L82-1 ~mode1~0 := 0; 252#L78-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 263#L104 assume !(0 != ~mode2~0 % 256); 245#L117 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite8 := ~send2~0; 246#L117-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; 279#L104-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 339#L129 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 340#L132 assume !(node3_~m3~0 != ~nomsg~0); 259#L132-1 ~mode3~0 := 0; 255#L129-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 256#L154 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 247#L157 assume !(node4_~m4~0 != ~nomsg~0); 248#L157-1 ~mode4~0 := 0; 260#L154-2 havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 342#L179 assume !(0 != ~mode5~0 % 256); 331#L192 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite11 := ~send5~0; 330#L192-2 ~p5_new~0 := (if node5_#t~ite11 % 256 <= 127 then node5_#t~ite11 % 256 else node5_#t~ite11 % 256 - 256);havoc node5_#t~ite11;~mode5~0 := 1; 277#L179-2 havoc node6_#t~ite12, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 278#L204 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 323#L207 assume !(node6_~m6~0 != ~nomsg~0); 292#L207-1 ~mode6~0 := 0; 293#L204-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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 320#L399 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 304#L399-1 check_#res := check_~tmp~1; 241#L419 main_#t~ret39 := check_#res;main_~c1~0 := main_#t~ret39;havoc main_#t~ret39;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 242#L502 assume !(0 == assert_~arg % 256); 297#L497 main_#t~post40 := main_~i2~0;main_~i2~0 := 1 + main_#t~post40;havoc main_#t~post40; 294#L469-2 [2021-08-31 04:58:06,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:58:06,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1716035805, now seen corresponding path program 1 times [2021-08-31 04:58:06,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:58:06,585 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275449582] [2021-08-31 04:58:06,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:58:06,586 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:58:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:58:06,658 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:58:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:58:06,721 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:58:06,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:58:06,723 INFO L82 PathProgramCache]: Analyzing trace with hash -695480405, now seen corresponding path program 1 times [2021-08-31 04:58:06,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:58:06,723 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860252118] [2021-08-31 04:58:06,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:58:06,723 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:58:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:58:06,848 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-31 04:58:06,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:58:06,848 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860252118] [2021-08-31 04:58:06,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860252118] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:58:06,849 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:58:06,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-31 04:58:06,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240036472] [2021-08-31 04:58:06,849 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:58:06,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:58:06,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-31 04:58:06,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-31 04:58:06,850 INFO L87 Difference]: Start difference. First operand 104 states and 139 transitions. cyclomatic complexity: 36 Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 04:58:07,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:58:07,251 INFO L93 Difference]: Finished difference Result 107 states and 141 transitions. [2021-08-31 04:58:07,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-31 04:58:07,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 141 transitions. [2021-08-31 04:58:07,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2021-08-31 04:58:07,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 104 states and 136 transitions. [2021-08-31 04:58:07,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2021-08-31 04:58:07,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2021-08-31 04:58:07,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 136 transitions. [2021-08-31 04:58:07,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:58:07,255 INFO L681 BuchiCegarLoop]: Abstraction has 104 states and 136 transitions. [2021-08-31 04:58:07,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 136 transitions. [2021-08-31 04:58:07,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-08-31 04:58:07,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 103 states have internal predecessors, (136), 0 states have call successors, (0), 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-31 04:58:07,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2021-08-31 04:58:07,260 INFO L704 BuchiCegarLoop]: Abstraction has 104 states and 136 transitions. [2021-08-31 04:58:07,260 INFO L587 BuchiCegarLoop]: Abstraction has 104 states and 136 transitions. [2021-08-31 04:58:07,261 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-31 04:58:07,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 136 transitions. [2021-08-31 04:58:07,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2021-08-31 04:58:07,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:58:07,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:58:07,263 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:58:07,263 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, 1, 1, 1] [2021-08-31 04:58:07,263 INFO L791 eck$LassoCheckResult]: Stem: 564#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 518#L-1 havoc main_#res;havoc 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~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~ret38, main_#t~ret39, main_#t~post40, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~id1~0 := main_#t~nondet14;havoc main_#t~nondet14;~st1~0 := main_#t~nondet15;havoc main_#t~nondet15;~send1~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~id3~0 := main_#t~nondet22;havoc main_#t~nondet22;~st3~0 := main_#t~nondet23;havoc main_#t~nondet23;~send3~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode3~0 := main_#t~nondet25;havoc main_#t~nondet25;~id4~0 := main_#t~nondet26;havoc main_#t~nondet26;~st4~0 := main_#t~nondet27;havoc main_#t~nondet27;~send4~0 := main_#t~nondet28;havoc main_#t~nondet28;~mode4~0 := main_#t~nondet29;havoc main_#t~nondet29;~id5~0 := main_#t~nondet30;havoc main_#t~nondet30;~st5~0 := main_#t~nondet31;havoc main_#t~nondet31;~send5~0 := main_#t~nondet32;havoc main_#t~nondet32;~mode5~0 := main_#t~nondet33;havoc main_#t~nondet33;~id6~0 := main_#t~nondet34;havoc main_#t~nondet34;~st6~0 := main_#t~nondet35;havoc main_#t~nondet35;~send6~0 := main_#t~nondet36;havoc main_#t~nondet36;~mode6~0 := main_#t~nondet37;havoc main_#t~nondet37;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 519#L230 assume 0 == ~r1~0; 547#L231 assume ~id1~0 >= 0; 549#L232 assume 0 == ~st1~0; 538#L233 assume ~send1~0 == ~id1~0; 539#L234 assume 0 == ~mode1~0 % 256; 544#L235 assume ~id2~0 >= 0; 531#L236 assume 0 == ~st2~0; 532#L237 assume ~send2~0 == ~id2~0; 506#L238 assume 0 == ~mode2~0 % 256; 507#L239 assume ~id3~0 >= 0; 504#L240 assume 0 == ~st3~0; 505#L241 assume ~send3~0 == ~id3~0; 509#L242 assume 0 == ~mode3~0 % 256; 548#L243 assume ~id4~0 >= 0; 473#L244 assume 0 == ~st4~0; 474#L245 assume ~send4~0 == ~id4~0; 508#L246 assume 0 == ~mode4~0 % 256; 537#L247 assume ~id5~0 >= 0; 558#L248 assume 0 == ~st5~0; 466#L249 assume ~send5~0 == ~id5~0; 467#L250 assume 0 == ~mode5~0 % 256; 550#L251 assume ~id6~0 >= 0; 523#L252 assume 0 == ~st6~0; 524#L253 assume ~send6~0 == ~id6~0; 528#L254 assume 0 == ~mode6~0 % 256; 484#L255 assume ~id1~0 != ~id2~0; 485#L256 assume ~id1~0 != ~id3~0; 525#L257 assume ~id1~0 != ~id4~0; 513#L258 assume ~id1~0 != ~id5~0; 514#L259 assume ~id1~0 != ~id6~0; 540#L260 assume ~id2~0 != ~id3~0; 541#L261 assume ~id2~0 != ~id4~0; 529#L262 assume ~id2~0 != ~id5~0; 530#L263 assume ~id2~0 != ~id6~0; 533#L264 assume ~id3~0 != ~id4~0; 534#L265 assume ~id3~0 != ~id5~0; 476#L266 assume ~id3~0 != ~id6~0; 477#L267 assume ~id4~0 != ~id5~0; 492#L268 assume ~id4~0 != ~id6~0; 493#L269 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 536#L230-1 init_#res := init_~tmp~0; 551#L391 main_#t~ret38 := init_#res;main_~i2~0 := main_#t~ret38;havoc main_#t~ret38;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; 521#L22 assume !(0 == assume_abort_if_not_~cond); 522#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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 517#L469-2 [2021-08-31 04:58:07,263 INFO L793 eck$LassoCheckResult]: Loop: 517#L469-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 496#L78 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 497#L82 assume !(node1_~m1~0 != ~nomsg~0); 463#L82-1 ~mode1~0 := 0; 475#L78-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 486#L104 assume !(0 != ~mode2~0 % 256); 468#L117 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite8 := ~send2~0; 469#L117-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; 502#L104-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 562#L129 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 563#L132 assume !(node3_~m3~0 != ~nomsg~0); 482#L132-1 ~mode3~0 := 0; 478#L129-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 479#L154 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 470#L157 assume !(node4_~m4~0 != ~nomsg~0); 471#L157-1 ~mode4~0 := 0; 483#L154-2 havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 565#L179 assume !(0 != ~mode5~0 % 256); 553#L192 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite11 := ~send5~0; 552#L192-2 ~p5_new~0 := (if node5_#t~ite11 % 256 <= 127 then node5_#t~ite11 % 256 else node5_#t~ite11 % 256 - 256);havoc node5_#t~ite11;~mode5~0 := 1; 500#L179-2 havoc node6_#t~ite12, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 501#L204 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 545#L207 assume !(node6_~m6~0 != ~nomsg~0); 515#L207-1 ~mode6~0 := 0; 516#L204-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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 542#L399 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 543#L400 assume ~r1~0 >= 6; 527#L404 assume ~r1~0 < 6;check_~tmp~1 := 1; 560#L399-1 check_#res := check_~tmp~1; 464#L419 main_#t~ret39 := check_#res;main_~c1~0 := main_#t~ret39;havoc main_#t~ret39;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 465#L502 assume !(0 == assert_~arg % 256); 520#L497 main_#t~post40 := main_~i2~0;main_~i2~0 := 1 + main_#t~post40;havoc main_#t~post40; 517#L469-2 [2021-08-31 04:58:07,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:58:07,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1716035805, now seen corresponding path program 2 times [2021-08-31 04:58:07,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:58:07,264 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505779751] [2021-08-31 04:58:07,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:58:07,265 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:58:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:58:07,286 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:58:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:58:07,328 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:58:07,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:58:07,329 INFO L82 PathProgramCache]: Analyzing trace with hash 242413115, now seen corresponding path program 1 times [2021-08-31 04:58:07,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:58:07,329 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789203553] [2021-08-31 04:58:07,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:58:07,330 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:58:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:58:07,355 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-31 04:58:07,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:58:07,356 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789203553] [2021-08-31 04:58:07,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789203553] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:58:07,356 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:58:07,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:58:07,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497807766] [2021-08-31 04:58:07,357 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:58:07,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:58:07,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 04:58:07,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 04:58:07,358 INFO L87 Difference]: Start difference. First operand 104 states and 136 transitions. cyclomatic complexity: 33 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 04:58:07,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:58:07,652 INFO L93 Difference]: Finished difference Result 156 states and 215 transitions. [2021-08-31 04:58:07,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 04:58:07,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 215 transitions. [2021-08-31 04:58:07,654 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 110 [2021-08-31 04:58:07,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 156 states and 215 transitions. [2021-08-31 04:58:07,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2021-08-31 04:58:07,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 156 [2021-08-31 04:58:07,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 215 transitions. [2021-08-31 04:58:07,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:58:07,657 INFO L681 BuchiCegarLoop]: Abstraction has 156 states and 215 transitions. [2021-08-31 04:58:07,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 215 transitions. [2021-08-31 04:58:07,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2021-08-31 04:58:07,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 156 states have (on average 1.3782051282051282) internal successors, (215), 155 states have internal predecessors, (215), 0 states have call successors, (0), 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-31 04:58:07,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 215 transitions. [2021-08-31 04:58:07,664 INFO L704 BuchiCegarLoop]: Abstraction has 156 states and 215 transitions. [2021-08-31 04:58:07,664 INFO L587 BuchiCegarLoop]: Abstraction has 156 states and 215 transitions. [2021-08-31 04:58:07,664 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-31 04:58:07,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 156 states and 215 transitions. [2021-08-31 04:58:07,665 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 110 [2021-08-31 04:58:07,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:58:07,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:58:07,666 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:58:07,666 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, 1, 1, 1, 1] [2021-08-31 04:58:07,667 INFO L791 eck$LassoCheckResult]: Stem: 834#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 786#L-1 havoc main_#res;havoc 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~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~ret38, main_#t~ret39, main_#t~post40, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~id1~0 := main_#t~nondet14;havoc main_#t~nondet14;~st1~0 := main_#t~nondet15;havoc main_#t~nondet15;~send1~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~id3~0 := main_#t~nondet22;havoc main_#t~nondet22;~st3~0 := main_#t~nondet23;havoc main_#t~nondet23;~send3~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode3~0 := main_#t~nondet25;havoc main_#t~nondet25;~id4~0 := main_#t~nondet26;havoc main_#t~nondet26;~st4~0 := main_#t~nondet27;havoc main_#t~nondet27;~send4~0 := main_#t~nondet28;havoc main_#t~nondet28;~mode4~0 := main_#t~nondet29;havoc main_#t~nondet29;~id5~0 := main_#t~nondet30;havoc main_#t~nondet30;~st5~0 := main_#t~nondet31;havoc main_#t~nondet31;~send5~0 := main_#t~nondet32;havoc main_#t~nondet32;~mode5~0 := main_#t~nondet33;havoc main_#t~nondet33;~id6~0 := main_#t~nondet34;havoc main_#t~nondet34;~st6~0 := main_#t~nondet35;havoc main_#t~nondet35;~send6~0 := main_#t~nondet36;havoc main_#t~nondet36;~mode6~0 := main_#t~nondet37;havoc main_#t~nondet37;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 787#L230 assume 0 == ~r1~0; 815#L231 assume ~id1~0 >= 0; 818#L232 assume 0 == ~st1~0; 806#L233 assume ~send1~0 == ~id1~0; 807#L234 assume 0 == ~mode1~0 % 256; 812#L235 assume ~id2~0 >= 0; 799#L236 assume 0 == ~st2~0; 800#L237 assume ~send2~0 == ~id2~0; 774#L238 assume 0 == ~mode2~0 % 256; 775#L239 assume ~id3~0 >= 0; 772#L240 assume 0 == ~st3~0; 773#L241 assume ~send3~0 == ~id3~0; 777#L242 assume 0 == ~mode3~0 % 256; 817#L243 assume ~id4~0 >= 0; 739#L244 assume 0 == ~st4~0; 740#L245 assume ~send4~0 == ~id4~0; 776#L246 assume 0 == ~mode4~0 % 256; 805#L247 assume ~id5~0 >= 0; 827#L248 assume 0 == ~st5~0; 732#L249 assume ~send5~0 == ~id5~0; 733#L250 assume 0 == ~mode5~0 % 256; 819#L251 assume ~id6~0 >= 0; 791#L252 assume 0 == ~st6~0; 792#L253 assume ~send6~0 == ~id6~0; 796#L254 assume 0 == ~mode6~0 % 256; 750#L255 assume ~id1~0 != ~id2~0; 751#L256 assume ~id1~0 != ~id3~0; 793#L257 assume ~id1~0 != ~id4~0; 781#L258 assume ~id1~0 != ~id5~0; 782#L259 assume ~id1~0 != ~id6~0; 808#L260 assume ~id2~0 != ~id3~0; 809#L261 assume ~id2~0 != ~id4~0; 797#L262 assume ~id2~0 != ~id5~0; 798#L263 assume ~id2~0 != ~id6~0; 801#L264 assume ~id3~0 != ~id4~0; 802#L265 assume ~id3~0 != ~id5~0; 742#L266 assume ~id3~0 != ~id6~0; 743#L267 assume ~id4~0 != ~id5~0; 759#L268 assume ~id4~0 != ~id6~0; 760#L269 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 804#L230-1 init_#res := init_~tmp~0; 820#L391 main_#t~ret38 := init_#res;main_~i2~0 := main_#t~ret38;havoc main_#t~ret38;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; 789#L22 assume !(0 == assume_abort_if_not_~cond); 790#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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 785#L469-2 [2021-08-31 04:58:07,667 INFO L793 eck$LassoCheckResult]: Loop: 785#L469-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 763#L78 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 764#L82 assume !(node1_~m1~0 != ~nomsg~0); 729#L82-1 ~mode1~0 := 0; 741#L78-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 752#L104 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 753#L107 assume !(node2_~m2~0 != ~nomsg~0); 758#L107-1 ~mode2~0 := 0; 770#L104-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 832#L129 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 833#L132 assume !(node3_~m3~0 != ~nomsg~0); 748#L132-1 ~mode3~0 := 0; 744#L129-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 745#L154 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 736#L157 assume !(node4_~m4~0 != ~nomsg~0); 737#L157-1 ~mode4~0 := 0; 749#L154-2 havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 836#L179 assume !(0 != ~mode5~0 % 256); 822#L192 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite11 := ~send5~0; 821#L192-2 ~p5_new~0 := (if node5_#t~ite11 % 256 <= 127 then node5_#t~ite11 % 256 else node5_#t~ite11 % 256 - 256);havoc node5_#t~ite11;~mode5~0 := 1; 767#L179-2 havoc node6_#t~ite12, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 768#L204 assume !(0 != ~mode6~0 % 256); 842#L217 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite12 := ~send6~0; 840#L217-2 ~p6_new~0 := (if node6_#t~ite12 % 256 <= 127 then node6_#t~ite12 % 256 else node6_#t~ite12 % 256 - 256);havoc node6_#t~ite12;~mode6~0 := 1; 839#L204-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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 838#L399 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 837#L400 assume !(~r1~0 >= 6); 794#L403 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; 795#L404 assume ~r1~0 < 6;check_~tmp~1 := 1; 835#L399-1 check_#res := check_~tmp~1; 730#L419 main_#t~ret39 := check_#res;main_~c1~0 := main_#t~ret39;havoc main_#t~ret39;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 731#L502 assume !(0 == assert_~arg % 256); 788#L497 main_#t~post40 := main_~i2~0;main_~i2~0 := 1 + main_#t~post40;havoc main_#t~post40; 785#L469-2 [2021-08-31 04:58:07,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:58:07,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1716035805, now seen corresponding path program 3 times [2021-08-31 04:58:07,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:58:07,668 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338979563] [2021-08-31 04:58:07,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:58:07,668 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:58:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:58:07,698 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:58:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:58:07,766 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:58:07,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:58:07,771 INFO L82 PathProgramCache]: Analyzing trace with hash -225026227, now seen corresponding path program 1 times [2021-08-31 04:58:07,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:58:07,772 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150535827] [2021-08-31 04:58:07,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:58:07,772 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:58:07,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:58:07,793 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:58:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:58:07,837 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:58:07,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:58:07,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1816204181, now seen corresponding path program 1 times [2021-08-31 04:58:07,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:58:07,838 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138714924] [2021-08-31 04:58:07,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:58:07,839 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:58:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:58:07,962 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-31 04:58:07,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:58:07,962 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138714924] [2021-08-31 04:58:07,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138714924] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:58:07,963 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:58:07,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:58:07,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045849431] [2021-08-31 04:58:09,385 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 04:58:09,386 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 04:58:09,386 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 04:58:09,386 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 04:58:09,388 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-31 04:58:09,388 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:09,388 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 04:58:09,389 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 04:58:09,394 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.6.ufo.BOUNDED-12.pals.c_Iteration4_Loop [2021-08-31 04:58:09,394 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 04:58:09,399 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 04:58:09,440 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-31 04:58:09,449 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-31 04:58:09,452 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-31 04:58:09,454 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-31 04:58:09,464 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-31 04:58:09,476 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-31 04:58:09,482 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-31 04:58:09,486 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-31 04:58:09,488 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-31 04:58:09,490 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-31 04:58:09,494 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-31 04:58:09,496 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-31 04:58:09,499 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-31 04:58:09,501 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-31 04:58:09,503 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-31 04:58:09,508 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-31 04:58:09,510 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-31 04:58:09,514 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-31 04:58:09,518 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-31 04:58:09,699 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-31 04:58:09,706 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-31 04:58:09,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-31 04:58:09,714 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-31 04:58:09,716 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-31 04:58:09,719 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-31 04:58:09,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-31 04:58:09,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-31 04:58:09,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-31 04:58:09,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-31 04:58:09,742 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-31 04:58:09,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-31 04:58:09,747 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-31 04:58:10,210 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2021-08-31 04:58:16,136 WARN L210 SmtUtils]: Spent 5.81s on a formula simplification. DAG size of input: 182 DAG size of output: 134 [2021-08-31 04:58:16,275 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 04:58:16,276 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-31 04:58:16,278 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:16,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:16,281 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-31 04:58:16,293 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 04:58:16,294 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:58:16,308 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-31 04:58:16,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-08-31 04:58:16,347 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:16,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:16,349 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-31 04:58:16,353 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-31 04:58:16,354 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-31 04:58:16,354 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:58:16,470 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-31 04:58:16,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2021-08-31 04:58:16,476 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 04:58:16,476 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 04:58:16,476 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 04:58:16,476 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 04:58:16,476 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 04:58:16,476 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:16,476 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 04:58:16,476 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 04:58:16,476 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.6.ufo.BOUNDED-12.pals.c_Iteration4_Loop [2021-08-31 04:58:16,476 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 04:58:16,476 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 04:58:16,481 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-31 04:58:16,496 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-31 04:58:16,499 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-31 04:58:16,501 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-31 04:58:16,503 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-31 04:58:16,519 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-31 04:58:16,522 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-31 04:58:16,527 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-31 04:58:16,530 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-31 04:58:16,535 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-31 04:58:16,541 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-31 04:58:16,544 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-31 04:58:16,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-31 04:58:16,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-31 04:58:16,724 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-31 04:58:16,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-31 04:58:16,729 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-31 04:58:16,731 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-31 04:58:16,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-31 04:58:16,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-31 04:58:16,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-31 04:58:16,747 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-31 04:58:16,749 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-31 04:58:16,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-31 04:58:16,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:16,756 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-31 04:58:16,759 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-31 04:58:16,761 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-31 04:58:16,766 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-31 04:58:16,771 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-31 04:58:16,773 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-31 04:58:16,781 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-31 04:58:17,224 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2021-08-31 04:58:22,930 WARN L210 SmtUtils]: Spent 5.61s on a formula simplification. DAG size of input: 182 DAG size of output: 134 [2021-08-31 04:58:23,019 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 04:58:23,023 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 04:58:23,025 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:23,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:23,033 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-31 04:58:23,037 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-31 04:58:23,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-31 04:58:23,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:58:23,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:58:23,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:58:23,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:58:23,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:58:23,053 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:58:23,053 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:58:23,068 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:58:23,096 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-31 04:58:23,096 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:23,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:23,100 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-31 04:58:23,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 04:58:23,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:58:23,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:58:23,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:58:23,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:58:23,128 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 04:58:23,128 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 04:58:23,136 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-31 04:58:23,144 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:58:23,171 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-31 04:58:23,174 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:23,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:23,176 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-31 04:58:23,178 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-31 04:58:23,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 04:58:23,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:58:23,188 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:58:23,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:58:23,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:58:23,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:58:23,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:58:23,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:58:23,212 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:58:23,239 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-31 04:58:23,240 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:23,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:23,241 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-31 04:58:23,243 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-31 04:58:23,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-31 04:58:23,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:58:23,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:58:23,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:58:23,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:58:23,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:58:23,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:58:23,254 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:58:23,264 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:58:23,295 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-31 04:58:23,296 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:23,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:23,297 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-31 04:58:23,299 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-31 04:58:23,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 04:58:23,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:58:23,309 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:58:23,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:58:23,309 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-08-31 04:58:23,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:58:23,312 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 04:58:23,313 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:58:23,328 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:58:23,356 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-31 04:58:23,356 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:23,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:23,358 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-31 04:58:23,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-31 04:58:23,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:58:23,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:58:23,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:58:23,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:58:23,380 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 04:58:23,380 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 04:58:23,383 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-31 04:58:23,392 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:58:23,420 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-31 04:58:23,420 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:23,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:23,422 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-31 04:58:23,424 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-31 04:58:23,426 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 04:58:23,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:58:23,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:58:23,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:58:23,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:58:23,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:58:23,436 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:58:23,436 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:58:23,452 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:58:23,480 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-31 04:58:23,480 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:23,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:23,481 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-31 04:58:23,489 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-31 04:58:23,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:58:23,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:58:23,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:58:23,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:58:23,499 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 04:58:23,500 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 04:58:23,502 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-31 04:58:23,512 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:58:23,543 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-31 04:58:23,543 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:23,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:23,545 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-31 04:58:23,546 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-31 04:58:23,548 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 04:58:23,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:58:23,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:58:23,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:58:23,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:58:23,559 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 04:58:23,559 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 04:58:23,584 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:58:23,611 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-31 04:58:23,612 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:23,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:23,613 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-31 04:58:23,619 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 04:58:23,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:58:23,628 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:58:23,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:58:23,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:58:23,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:58:23,629 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:58:23,630 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:58:23,632 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-31 04:58:23,640 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:58:23,666 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-31 04:58:23,666 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:23,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:23,667 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-31 04:58:23,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 04:58:23,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:58:23,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:58:23,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:58:23,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:58:23,690 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 04:58:23,690 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 04:58:23,693 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-31 04:58:23,704 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:58:23,731 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-31 04:58:23,732 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:23,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:23,733 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-31 04:58:23,735 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-31 04:58:23,736 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-31 04:58:23,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:58:23,746 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:58:23,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:58:23,746 INFO L204 nArgumentSynthesizer]: 16 loop disjuncts [2021-08-31 04:58:23,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:58:23,889 INFO L401 nArgumentSynthesizer]: We have 32 Motzkin's Theorem applications. [2021-08-31 04:58:23,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:58:24,025 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:58:24,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-08-31 04:58:24,056 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:24,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:24,058 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-31 04:58:24,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-31 04:58:24,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:58:24,086 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:58:24,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:58:24,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:58:24,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:58:24,087 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:58:24,087 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:58:24,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-08-31 04:58:24,096 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:58:24,124 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-31 04:58:24,124 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:24,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:24,126 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-31 04:58:24,127 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-31 04:58:24,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-31 04:58:24,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:58:24,137 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:58:24,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:58:24,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:58:24,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:58:24,137 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:58:24,137 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:58:24,152 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:58:24,179 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-31 04:58:24,180 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:24,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:24,181 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-31 04:58:24,183 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-31 04:58:24,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-31 04:58:24,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:58:24,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:58:24,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:58:24,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:58:24,195 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 04:58:24,196 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 04:58:24,209 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:58:24,239 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-31 04:58:24,240 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:24,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:24,241 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-31 04:58:24,242 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-31 04:58:24,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-31 04:58:24,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:58:24,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:58:24,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:58:24,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:58:24,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:58:24,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:58:24,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:58:24,267 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:58:24,293 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-31 04:58:24,294 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:24,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:24,295 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-31 04:58:24,299 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-31 04:58:24,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 04:58:24,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:58:24,309 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:58:24,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:58:24,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:58:24,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:58:24,309 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:58:24,309 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:58:24,310 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:58:24,329 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-31 04:58:24,329 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:24,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:24,330 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:58:24,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-08-31 04:58:24,332 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-31 04:58:24,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:58:24,338 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:58:24,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:58:24,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:58:24,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:58:24,340 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:58:24,340 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:58:24,346 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 04:58:24,371 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-31 04:58:24,371 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-31 04:58:24,372 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:24,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:24,373 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:58:24,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-08-31 04:58:24,376 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 04:58:24,376 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-31 04:58:24,376 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 04:58:24,377 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 23 Supporting invariants [] [2021-08-31 04:58:24,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-08-31 04:58:24,410 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-31 04:58:24,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:58:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:58:24,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 04:58:24,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 04:58:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:58:24,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-31 04:58:24,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 04:58:24,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:58:24,860 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-31 04:58:24,861 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 156 states and 215 transitions. cyclomatic complexity: 60 Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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-31 04:58:25,085 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 156 states and 215 transitions. cyclomatic complexity: 60. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 265 states and 384 transitions. Complement of second has 4 states. [2021-08-31 04:58:25,086 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-31 04:58:25,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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-31 04:58:25,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2021-08-31 04:58:25,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 136 transitions. Stem has 46 letters. Loop has 33 letters. [2021-08-31 04:58:25,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 04:58:25,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 136 transitions. Stem has 79 letters. Loop has 33 letters. [2021-08-31 04:58:25,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 04:58:25,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 136 transitions. Stem has 46 letters. Loop has 66 letters. [2021-08-31 04:58:25,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 04:58:25,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 265 states and 384 transitions. [2021-08-31 04:58:25,094 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-31 04:58:25,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 265 states to 0 states and 0 transitions. [2021-08-31 04:58:25,095 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-31 04:58:25,095 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-31 04:58:25,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-31 04:58:25,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:58:25,095 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-31 04:58:25,096 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-31 04:58:25,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:58:25,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 04:58:25,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 04:58:25,097 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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-31 04:58:25,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:58:25,097 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-08-31 04:58:25,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-31 04:58:25,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2021-08-31 04:58:25,098 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-31 04:58:25,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2021-08-31 04:58:25,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-31 04:58:25,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-31 04:58:25,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-31 04:58:25,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:58:25,098 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-31 04:58:25,099 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-31 04:58:25,099 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-31 04:58:25,099 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-31 04:58:25,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-08-31 04:58:25,099 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-31 04:58:25,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-08-31 04:58:25,102 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) at de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData.toString(StatisticsData.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerTimingBenchmark.toString(BuchiAutomizerTimingBenchmark.java:44) at de.uni_freiburg.informatik.ultimate.core.lib.results.StatisticsResult.getLongDescription(StatisticsResult.java:58) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.reportResult(BuchiAutomizerObserver.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:161) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-08-31 04:58:25,104 INFO L158 Benchmark]: Toolchain (without parser) took 20817.74ms. Allocated memory was 52.4MB in the beginning and 119.5MB in the end (delta: 67.1MB). Free memory was 28.5MB in the beginning and 28.5MB in the end (delta: -39.8kB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. [2021-08-31 04:58:25,104 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 52.4MB. Free memory is still 34.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 04:58:25,105 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.16ms. Allocated memory was 52.4MB in the beginning and 67.1MB in the end (delta: 14.7MB). Free memory was 28.3MB in the beginning and 47.2MB in the end (delta: -18.9MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2021-08-31 04:58:25,105 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.77ms. Allocated memory is still 67.1MB. Free memory was 47.0MB in the beginning and 44.5MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-08-31 04:58:25,105 INFO L158 Benchmark]: Boogie Preprocessor took 64.66ms. Allocated memory is still 67.1MB. Free memory was 44.5MB in the beginning and 42.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-31 04:58:25,106 INFO L158 Benchmark]: RCFGBuilder took 455.99ms. Allocated memory is still 67.1MB. Free memory was 42.2MB in the beginning and 39.3MB in the end (delta: 2.9MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2021-08-31 04:58:25,106 INFO L158 Benchmark]: BuchiAutomizer took 19836.26ms. Allocated memory was 67.1MB in the beginning and 119.5MB in the end (delta: 52.4MB). Free memory was 39.1MB in the beginning and 28.5MB in the end (delta: 10.5MB). Peak memory consumption was 61.6MB. Max. memory is 16.1GB. [2021-08-31 04:58:25,108 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.42ms. Allocated memory is still 52.4MB. Free memory is still 34.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 381.16ms. Allocated memory was 52.4MB in the beginning and 67.1MB in the end (delta: 14.7MB). Free memory was 28.3MB in the beginning and 47.2MB in the end (delta: -18.9MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.77ms. Allocated memory is still 67.1MB. Free memory was 47.0MB in the beginning and 44.5MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.66ms. Allocated memory is still 67.1MB. Free memory was 44.5MB in the beginning and 42.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 455.99ms. Allocated memory is still 67.1MB. Free memory was 42.2MB in the beginning and 39.3MB in the end (delta: 2.9MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 19836.26ms. Allocated memory was 67.1MB in the beginning and 119.5MB in the end (delta: 52.4MB). Free memory was 39.1MB in the beginning and 28.5MB in the end (delta: 10.5MB). Peak memory consumption was 61.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 23 + -2 * i2 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6): de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-08-31 04:58:25,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-08-31 04:58:25,368 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...