./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f4b24e32 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_floodmax.3.2.ufo.BOUNDED-6.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 708f088db085ec098a8544d76f8abbece9dbe61a183e0bc1703749c9af891b6b --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 16:05:47,940 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 16:05:47,964 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 16:05:47,999 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 16:05:48,000 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 16:05:48,001 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 16:05:48,003 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 16:05:48,004 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 16:05:48,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 16:05:48,009 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 16:05:48,010 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 16:05:48,011 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 16:05:48,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 16:05:48,013 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 16:05:48,013 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 16:05:48,016 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 16:05:48,016 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 16:05:48,017 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 16:05:48,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 16:05:48,022 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 16:05:48,024 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 16:05:48,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 16:05:48,025 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 16:05:48,026 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 16:05:48,027 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 16:05:48,032 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 16:05:48,032 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 16:05:48,032 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 16:05:48,033 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 16:05:48,033 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 16:05:48,034 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 16:05:48,035 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 16:05:48,036 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 16:05:48,036 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 16:05:48,037 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 16:05:48,037 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 16:05:48,038 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 16:05:48,038 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 16:05:48,038 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 16:05:48,039 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 16:05:48,039 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 16:05:48,040 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 16:05:48,041 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-14 16:05:48,057 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 16:05:48,057 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 16:05:48,058 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 16:05:48,058 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 16:05:48,059 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 16:05:48,059 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 16:05:48,059 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 16:05:48,059 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 16:05:48,060 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 16:05:48,060 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 16:05:48,060 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 16:05:48,060 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 16:05:48,061 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 16:05:48,061 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 16:05:48,061 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 16:05:48,061 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 16:05:48,061 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 16:05:48,061 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 16:05:48,061 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 16:05:48,062 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 16:05:48,062 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 16:05:48,062 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 16:05:48,062 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 16:05:48,062 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 16:05:48,062 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 16:05:48,062 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 16:05:48,063 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 16:05:48,063 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 16:05:48,063 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 16:05:48,063 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 16:05:48,063 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 16:05:48,064 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 16:05:48,064 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 -> 708f088db085ec098a8544d76f8abbece9dbe61a183e0bc1703749c9af891b6b [2022-07-14 16:05:48,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 16:05:48,258 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 16:05:48,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 16:05:48,260 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 16:05:48,262 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 16:05:48,263 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c [2022-07-14 16:05:48,317 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d33aaea50/0e4d72b7ecc94b33b07d6d4833f3427c/FLAG0e79b7837 [2022-07-14 16:05:48,699 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 16:05:48,699 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c [2022-07-14 16:05:48,705 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d33aaea50/0e4d72b7ecc94b33b07d6d4833f3427c/FLAG0e79b7837 [2022-07-14 16:05:48,715 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d33aaea50/0e4d72b7ecc94b33b07d6d4833f3427c [2022-07-14 16:05:48,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 16:05:48,717 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 16:05:48,719 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 16:05:48,719 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 16:05:48,721 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 16:05:48,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:05:48" (1/1) ... [2022-07-14 16:05:48,722 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e405cd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:05:48, skipping insertion in model container [2022-07-14 16:05:48,722 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:05:48" (1/1) ... [2022-07-14 16:05:48,726 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 16:05:48,747 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 16:05:48,903 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c[12764,12777] [2022-07-14 16:05:48,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 16:05:48,909 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 16:05:48,951 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c[12764,12777] [2022-07-14 16:05:48,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 16:05:48,961 INFO L208 MainTranslator]: Completed translation [2022-07-14 16:05:48,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:05:48 WrapperNode [2022-07-14 16:05:48,962 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 16:05:48,963 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 16:05:48,963 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 16:05:48,963 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 16:05:48,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:05:48" (1/1) ... [2022-07-14 16:05:48,975 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:05:48" (1/1) ... [2022-07-14 16:05:48,998 INFO L137 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 421 [2022-07-14 16:05:48,998 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 16:05:48,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 16:05:48,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 16:05:48,999 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 16:05:49,004 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:05:48" (1/1) ... [2022-07-14 16:05:49,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:05:48" (1/1) ... [2022-07-14 16:05:49,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:05:48" (1/1) ... [2022-07-14 16:05:49,007 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:05:48" (1/1) ... [2022-07-14 16:05:49,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:05:48" (1/1) ... [2022-07-14 16:05:49,016 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:05:48" (1/1) ... [2022-07-14 16:05:49,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:05:48" (1/1) ... [2022-07-14 16:05:49,020 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 16:05:49,020 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 16:05:49,020 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 16:05:49,020 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 16:05:49,021 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:05:48" (1/1) ... [2022-07-14 16:05:49,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:05:49,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:05:49,051 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) [2022-07-14 16:05:49,057 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 [2022-07-14 16:05:49,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 16:05:49,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 16:05:49,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 16:05:49,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 16:05:49,160 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 16:05:49,161 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 16:05:49,513 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 16:05:49,523 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 16:05:49,524 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-14 16:05:49,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:05:49 BoogieIcfgContainer [2022-07-14 16:05:49,537 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 16:05:49,538 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 16:05:49,538 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 16:05:49,541 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 16:05:49,541 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 16:05:49,542 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 04:05:48" (1/3) ... [2022-07-14 16:05:49,542 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@207fc2d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 04:05:49, skipping insertion in model container [2022-07-14 16:05:49,542 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 16:05:49,542 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:05:48" (2/3) ... [2022-07-14 16:05:49,543 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@207fc2d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 04:05:49, skipping insertion in model container [2022-07-14 16:05:49,543 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 16:05:49,543 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:05:49" (3/3) ... [2022-07-14 16:05:49,544 INFO L354 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.BOUNDED-6.pals.c [2022-07-14 16:05:49,597 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 16:05:49,598 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 16:05:49,598 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 16:05:49,598 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 16:05:49,598 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 16:05:49,598 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 16:05:49,598 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 16:05:49,598 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 16:05:49,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 130 states, 129 states have (on average 1.751937984496124) internal successors, (226), 129 states have internal predecessors, (226), 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) [2022-07-14 16:05:49,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2022-07-14 16:05:49,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:05:49,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:05:49,622 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:05:49,622 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:05:49,622 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 16:05:49,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 130 states, 129 states have (on average 1.751937984496124) internal successors, (226), 129 states have internal predecessors, (226), 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) [2022-07-14 16:05:49,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2022-07-14 16:05:49,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:05:49,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:05:49,630 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:05:49,630 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:05:49,634 INFO L752 eck$LassoCheckResult]: Stem: 119#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 45#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_#t~post39#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 94#L228true assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 50#L231-1true init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 33#L241true assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 29#L244-1true init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 60#L254true assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 63#L257-1true init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 26#L267true assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 14#L270-1true init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 101#L280true assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 80#L283-1true init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 118#L293true assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 78#L296-1true init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 128#L306true assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 115#L306-1true init_#res#1 := init_~tmp___5~0#1; 110#L415true main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; 52#L509true assume !(0 == main_~i2~0#1); 89#L509-2true ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 34#L523-2true [2022-07-14 16:05:49,635 INFO L754 eck$LassoCheckResult]: Loop: 34#L523-2true assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 69#L75true assume !(0 != ~mode1~0 % 256); 65#L100true assume !(~r1~0 < 2); 83#L100-1true ~mode1~0 := 1; 116#L75-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 100#L118true assume !(0 != ~mode2~0 % 256); 104#L143true assume !(~r2~0 < 2); 95#L143-1true ~mode2~0 := 1; 66#L118-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 13#L161true assume !(0 != ~mode3~0 % 256); 73#L186true assume !(~r3~0 < 2); 28#L186-1true ~mode3~0 := 1; 5#L161-2true assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 20#L423true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 70#L423-1true check_#res#1 := check_~tmp~1#1; 27#L471true main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 86#L553true assume !(0 == assert_~arg#1 % 256); 71#L548true assume { :end_inline_assert } true;main_#t~post39#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post39#1;havoc main_#t~post39#1; 34#L523-2true [2022-07-14 16:05:49,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:05:49,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1727567734, now seen corresponding path program 1 times [2022-07-14 16:05:49,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:05:49,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781789162] [2022-07-14 16:05:49,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:05:49,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:05:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:05:49,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:05:49,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:05:49,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781789162] [2022-07-14 16:05:49,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781789162] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:05:49,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:05:49,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 16:05:49,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436477773] [2022-07-14 16:05:49,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:05:49,859 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 16:05:49,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:05:49,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1518597457, now seen corresponding path program 1 times [2022-07-14 16:05:49,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:05:49,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435136394] [2022-07-14 16:05:49,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:05:49,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:05:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:05:49,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:05:49,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:05:49,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435136394] [2022-07-14 16:05:49,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435136394] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:05:49,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:05:49,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 16:05:49,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528807411] [2022-07-14 16:05:49,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:05:49,948 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 16:05:49,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:05:49,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 16:05:49,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 16:05:49,970 INFO L87 Difference]: Start difference. First operand has 130 states, 129 states have (on average 1.751937984496124) internal successors, (226), 129 states have internal predecessors, (226), 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 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2022-07-14 16:05:50,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:05:50,023 INFO L93 Difference]: Finished difference Result 134 states and 226 transitions. [2022-07-14 16:05:50,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 16:05:50,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 226 transitions. [2022-07-14 16:05:50,031 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2022-07-14 16:05:50,034 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 125 states and 210 transitions. [2022-07-14 16:05:50,034 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2022-07-14 16:05:50,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2022-07-14 16:05:50,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 210 transitions. [2022-07-14 16:05:50,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:05:50,036 INFO L369 hiAutomatonCegarLoop]: Abstraction has 125 states and 210 transitions. [2022-07-14 16:05:50,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 210 transitions. [2022-07-14 16:05:50,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-07-14 16:05:50,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.68) internal successors, (210), 124 states have internal predecessors, (210), 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) [2022-07-14 16:05:50,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 210 transitions. [2022-07-14 16:05:50,065 INFO L392 hiAutomatonCegarLoop]: Abstraction has 125 states and 210 transitions. [2022-07-14 16:05:50,065 INFO L374 stractBuchiCegarLoop]: Abstraction has 125 states and 210 transitions. [2022-07-14 16:05:50,065 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 16:05:50,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 210 transitions. [2022-07-14 16:05:50,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2022-07-14 16:05:50,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:05:50,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:05:50,067 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:05:50,067 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-14 16:05:50,067 INFO L752 eck$LassoCheckResult]: Stem: 405#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 353#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_#t~post39#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 354#L228 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 360#L231-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 337#L241 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 295#L244-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 335#L254 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 345#L257-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 331#L267 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 299#L270-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 309#L280 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 381#L283-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 386#L293 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 347#L296-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 385#L306 assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 284#L306-1 init_#res#1 := init_~tmp___5~0#1; 403#L415 main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; 362#L509 assume !(0 == main_~i2~0#1); 363#L509-2 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 338#L523-2 [2022-07-14 16:05:50,068 INFO L754 eck$LassoCheckResult]: Loop: 338#L523-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 339#L75 assume !(0 != ~mode1~0 % 256); 375#L100 assume !(~r1~0 < 2); 355#L100-1 ~mode1~0 := 1; 328#L75-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 395#L118 assume !(0 != ~mode2~0 % 256); 396#L143 assume !(~r2~0 < 2); 350#L143-1 ~mode2~0 := 1; 377#L118-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 306#L161 assume !(0 != ~mode3~0 % 256); 308#L186 assume !(~r3~0 < 2); 334#L186-1 ~mode3~0 := 1; 287#L161-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 288#L423 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 319#L424 assume ~st1~0 + ~nl1~0 <= 1; 401#L425 assume ~st2~0 + ~nl2~0 <= 1; 402#L426 assume ~st3~0 + ~nl3~0 <= 1; 394#L427 assume ~r1~0 >= 2; 311#L431 assume ~r1~0 < 2; 351#L436 assume ~r1~0 >= 2; 322#L441 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 323#L423-1 check_#res#1 := check_~tmp~1#1; 332#L471 main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 333#L553 assume !(0 == assert_~arg#1 % 256); 379#L548 assume { :end_inline_assert } true;main_#t~post39#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post39#1;havoc main_#t~post39#1; 338#L523-2 [2022-07-14 16:05:50,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:05:50,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1727567734, now seen corresponding path program 2 times [2022-07-14 16:05:50,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:05:50,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40819569] [2022-07-14 16:05:50,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:05:50,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:05:50,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:05:50,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:05:50,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:05:50,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40819569] [2022-07-14 16:05:50,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40819569] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:05:50,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:05:50,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 16:05:50,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086384375] [2022-07-14 16:05:50,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:05:50,108 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 16:05:50,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:05:50,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1802356988, now seen corresponding path program 1 times [2022-07-14 16:05:50,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:05:50,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512925056] [2022-07-14 16:05:50,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:05:50,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:05:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:05:50,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:05:50,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:05:50,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512925056] [2022-07-14 16:05:50,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512925056] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:05:50,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:05:50,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:05:50,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541319128] [2022-07-14 16:05:50,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:05:50,128 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 16:05:50,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:05:50,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 16:05:50,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 16:05:50,129 INFO L87 Difference]: Start difference. First operand 125 states and 210 transitions. cyclomatic complexity: 86 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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) [2022-07-14 16:05:50,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:05:50,178 INFO L93 Difference]: Finished difference Result 196 states and 320 transitions. [2022-07-14 16:05:50,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 16:05:50,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 196 states and 320 transitions. [2022-07-14 16:05:50,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2022-07-14 16:05:50,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 196 states to 193 states and 291 transitions. [2022-07-14 16:05:50,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 193 [2022-07-14 16:05:50,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 193 [2022-07-14 16:05:50,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 193 states and 291 transitions. [2022-07-14 16:05:50,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:05:50,188 INFO L369 hiAutomatonCegarLoop]: Abstraction has 193 states and 291 transitions. [2022-07-14 16:05:50,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states and 291 transitions. [2022-07-14 16:05:50,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 125. [2022-07-14 16:05:50,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.464) internal successors, (183), 124 states have internal predecessors, (183), 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) [2022-07-14 16:05:50,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 183 transitions. [2022-07-14 16:05:50,193 INFO L392 hiAutomatonCegarLoop]: Abstraction has 125 states and 183 transitions. [2022-07-14 16:05:50,193 INFO L374 stractBuchiCegarLoop]: Abstraction has 125 states and 183 transitions. [2022-07-14 16:05:50,193 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 16:05:50,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 183 transitions. [2022-07-14 16:05:50,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2022-07-14 16:05:50,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:05:50,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:05:50,195 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-14 16:05:50,195 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-14 16:05:50,195 INFO L752 eck$LassoCheckResult]: Stem: 739#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 687#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_#t~post39#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 688#L228 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 694#L231-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 671#L241 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 628#L244-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 668#L254 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 679#L257-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 664#L267 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 632#L270-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 642#L280 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 715#L283-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 721#L293 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 681#L296-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 719#L306 assume ~id1~0 != ~id2~0; 723#L307 assume ~id1~0 != ~id3~0; 637#L308 assume ~id2~0 != ~id3~0; 638#L309 assume ~id1~0 >= 0; 722#L310 assume ~id2~0 >= 0; 701#L311 assume ~id3~0 >= 0; 702#L312 assume 0 == ~r1~0; 662#L313 assume 0 == ~r2~0; 663#L314 assume 0 == ~r3~0; 692#L315 assume 0 != init_~r122~0#1 % 256; 693#L316 assume 0 != init_~r132~0#1 % 256; 618#L317 assume 0 != init_~r212~0#1 % 256; 619#L318 assume 0 != init_~r232~0#1 % 256; 740#L319 assume 0 != init_~r312~0#1 % 256; 727#L320 assume 0 != init_~r322~0#1 % 256; 717#L321 assume ~max1~0 == ~id1~0; 718#L322 assume ~max2~0 == ~id2~0; 616#L323 assume ~max3~0 == ~id3~0; 617#L324 assume 0 == ~st1~0; 645#L325 assume 0 == ~st2~0; 670#L326 assume 0 == ~st3~0; 653#L327 assume 0 == ~nl1~0; 654#L328 assume 0 == ~nl2~0; 682#L329 assume 0 == ~nl3~0; 683#L330 assume 0 == ~mode1~0 % 256; 635#L331 assume 0 == ~mode2~0 % 256; 636#L332 assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; 669#L306-1 init_#res#1 := init_~tmp___5~0#1; 737#L415 main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; 699#L509 assume !(0 == main_~i2~0#1); 700#L509-2 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 674#L523-2 [2022-07-14 16:05:50,195 INFO L754 eck$LassoCheckResult]: Loop: 674#L523-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 675#L75 assume !(0 != ~mode1~0 % 256); 709#L100 assume !(~r1~0 < 2); 689#L100-1 ~mode1~0 := 1; 661#L75-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 729#L118 assume !(0 != ~mode2~0 % 256); 730#L143 assume !(~r2~0 < 2); 684#L143-1 ~mode2~0 := 1; 711#L118-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 639#L161 assume !(0 != ~mode3~0 % 256); 641#L186 assume !(~r3~0 < 2); 667#L186-1 ~mode3~0 := 1; 620#L161-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 621#L423 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 650#L424 assume ~st1~0 + ~nl1~0 <= 1; 735#L425 assume ~st2~0 + ~nl2~0 <= 1; 736#L426 assume ~st3~0 + ~nl3~0 <= 1; 728#L427 assume ~r1~0 >= 2; 644#L431 assume ~r1~0 < 2; 685#L436 assume ~r1~0 >= 2; 655#L441 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 656#L423-1 check_#res#1 := check_~tmp~1#1; 665#L471 main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 666#L553 assume !(0 == assert_~arg#1 % 256); 713#L548 assume { :end_inline_assert } true;main_#t~post39#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post39#1;havoc main_#t~post39#1; 674#L523-2 [2022-07-14 16:05:50,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:05:50,202 INFO L85 PathProgramCache]: Analyzing trace with hash -97176065, now seen corresponding path program 1 times [2022-07-14 16:05:50,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:05:50,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007857712] [2022-07-14 16:05:50,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:05:50,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:05:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:05:50,238 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:05:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:05:50,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:05:50,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:05:50,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1802356988, now seen corresponding path program 2 times [2022-07-14 16:05:50,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:05:50,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652579248] [2022-07-14 16:05:50,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:05:50,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:05:50,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:05:50,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:05:50,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:05:50,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652579248] [2022-07-14 16:05:50,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652579248] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:05:50,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:05:50,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:05:50,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182427177] [2022-07-14 16:05:50,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:05:50,323 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 16:05:50,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:05:50,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 16:05:50,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 16:05:50,324 INFO L87 Difference]: Start difference. First operand 125 states and 183 transitions. cyclomatic complexity: 59 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:05:50,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:05:50,347 INFO L93 Difference]: Finished difference Result 176 states and 259 transitions. [2022-07-14 16:05:50,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 16:05:50,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 176 states and 259 transitions. [2022-07-14 16:05:50,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 119 [2022-07-14 16:05:50,353 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 176 states to 176 states and 259 transitions. [2022-07-14 16:05:50,353 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 176 [2022-07-14 16:05:50,354 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 176 [2022-07-14 16:05:50,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 176 states and 259 transitions. [2022-07-14 16:05:50,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:05:50,358 INFO L369 hiAutomatonCegarLoop]: Abstraction has 176 states and 259 transitions. [2022-07-14 16:05:50,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states and 259 transitions. [2022-07-14 16:05:50,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2022-07-14 16:05:50,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 176 states have (on average 1.4715909090909092) internal successors, (259), 175 states have internal predecessors, (259), 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) [2022-07-14 16:05:50,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 259 transitions. [2022-07-14 16:05:50,375 INFO L392 hiAutomatonCegarLoop]: Abstraction has 176 states and 259 transitions. [2022-07-14 16:05:50,375 INFO L374 stractBuchiCegarLoop]: Abstraction has 176 states and 259 transitions. [2022-07-14 16:05:50,375 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 16:05:50,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 176 states and 259 transitions. [2022-07-14 16:05:50,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 119 [2022-07-14 16:05:50,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:05:50,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:05:50,379 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-14 16:05:50,380 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-14 16:05:50,380 INFO L752 eck$LassoCheckResult]: Stem: 1052#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 993#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_#t~post39#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 994#L228 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 1000#L231-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 977#L241 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 935#L244-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 975#L254 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 985#L257-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 970#L267 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 939#L270-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 949#L280 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 1022#L283-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 1029#L293 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 987#L296-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 1027#L306 assume ~id1~0 != ~id2~0; 1031#L307 assume ~id1~0 != ~id3~0; 944#L308 assume ~id2~0 != ~id3~0; 945#L309 assume ~id1~0 >= 0; 1030#L310 assume ~id2~0 >= 0; 1007#L311 assume ~id3~0 >= 0; 1008#L312 assume 0 == ~r1~0; 968#L313 assume 0 == ~r2~0; 969#L314 assume 0 == ~r3~0; 996#L315 assume 0 != init_~r122~0#1 % 256; 997#L316 assume 0 != init_~r132~0#1 % 256; 925#L317 assume 0 != init_~r212~0#1 % 256; 926#L318 assume 0 != init_~r232~0#1 % 256; 1055#L319 assume 0 != init_~r312~0#1 % 256; 1036#L320 assume 0 != init_~r322~0#1 % 256; 1025#L321 assume ~max1~0 == ~id1~0; 1026#L322 assume ~max2~0 == ~id2~0; 923#L323 assume ~max3~0 == ~id3~0; 924#L324 assume 0 == ~st1~0; 950#L325 assume 0 == ~st2~0; 976#L326 assume 0 == ~st3~0; 960#L327 assume 0 == ~nl1~0; 961#L328 assume 0 == ~nl2~0; 988#L329 assume 0 == ~nl3~0; 989#L330 assume 0 == ~mode1~0 % 256; 942#L331 assume 0 == ~mode2~0 % 256; 943#L332 assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; 974#L306-1 init_#res#1 := init_~tmp___5~0#1; 1050#L415 main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; 1002#L509 assume !(0 == main_~i2~0#1); 1003#L509-2 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 1035#L523-2 [2022-07-14 16:05:50,381 INFO L754 eck$LassoCheckResult]: Loop: 1035#L523-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 1057#L75 assume !(0 != ~mode1~0 % 256); 1056#L100 assume ~r1~0 < 2; 1053#L101 assume !(0 != ~ep12~0 % 256); 999#L101-2 assume !(0 != ~ep13~0 % 256); 995#L100-1 ~mode1~0 := 1; 967#L75-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 1040#L118 assume !(0 != ~mode2~0 % 256); 1041#L143 assume !(~r2~0 < 2); 990#L143-1 ~mode2~0 := 1; 1018#L118-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 946#L161 assume !(0 != ~mode3~0 % 256); 948#L186 assume !(~r3~0 < 2); 1070#L186-1 ~mode3~0 := 1; 1068#L161-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 1067#L423 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 1066#L424 assume ~st1~0 + ~nl1~0 <= 1; 1065#L425 assume ~st2~0 + ~nl2~0 <= 1; 1064#L426 assume ~st3~0 + ~nl3~0 <= 1; 1063#L427 assume !(~r1~0 >= 2); 951#L430 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 952#L431 assume ~r1~0 < 2; 1062#L436 assume !(~r1~0 >= 2); 1044#L440 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 1045#L441 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 1061#L423-1 check_#res#1 := check_~tmp~1#1; 1060#L471 main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 1059#L553 assume !(0 == assert_~arg#1 % 256); 1058#L548 assume { :end_inline_assert } true;main_#t~post39#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post39#1;havoc main_#t~post39#1; 1035#L523-2 [2022-07-14 16:05:50,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:05:50,381 INFO L85 PathProgramCache]: Analyzing trace with hash -97176065, now seen corresponding path program 2 times [2022-07-14 16:05:50,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:05:50,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277260453] [2022-07-14 16:05:50,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:05:50,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:05:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:05:50,400 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:05:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:05:50,421 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:05:50,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:05:50,428 INFO L85 PathProgramCache]: Analyzing trace with hash -480396747, now seen corresponding path program 1 times [2022-07-14 16:05:50,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:05:50,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128436051] [2022-07-14 16:05:50,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:05:50,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:05:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:05:50,442 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:05:50,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:05:50,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:05:50,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:05:50,450 INFO L85 PathProgramCache]: Analyzing trace with hash 472050935, now seen corresponding path program 1 times [2022-07-14 16:05:50,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:05:50,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120833172] [2022-07-14 16:05:50,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:05:50,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:05:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:05:50,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:05:50,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:05:50,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120833172] [2022-07-14 16:05:50,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120833172] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:05:50,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:05:50,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:05:50,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301777722] [2022-07-14 16:05:50,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:05:50,945 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 16:05:50,946 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 16:05:50,946 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 16:05:50,946 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 16:05:50,947 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 16:05:50,947 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:05:50,947 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 16:05:50,947 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 16:05:50,947 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3.2.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2022-07-14 16:05:50,947 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 16:05:50,947 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 16:05:50,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:50,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:50,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:50,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:50,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:50,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:50,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:50,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:50,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:50,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:50,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:50,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:50,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:50,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:50,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:51,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:51,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:51,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:51,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:51,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:51,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:51,295 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 16:05:51,297 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 16:05:51,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:05:51,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:05:51,300 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) [2022-07-14 16:05:51,306 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 [2022-07-14 16:05:51,306 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:05:51,307 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:05:51,325 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 16:05:51,325 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~ep12~0=0} Honda state: {~ep12~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 16:05:51,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-14 16:05:51,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:05:51,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:05:51,342 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) [2022-07-14 16:05:51,342 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 [2022-07-14 16:05:51,344 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:05:51,344 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:05:51,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-14 16:05:51,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:05:51,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:05:51,369 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) [2022-07-14 16:05:51,371 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 [2022-07-14 16:05:51,371 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 16:05:51,372 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:05:51,462 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 16:05:51,468 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 [2022-07-14 16:05:51,468 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 16:05:51,469 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 16:05:51,469 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 16:05:51,469 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 16:05:51,469 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 16:05:51,469 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:05:51,469 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 16:05:51,469 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 16:05:51,469 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3.2.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2022-07-14 16:05:51,469 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 16:05:51,469 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 16:05:51,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:51,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:51,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:51,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:51,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:51,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:51,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:51,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:51,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:51,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:51,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:51,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:51,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:51,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:51,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:51,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:51,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:51,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:51,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:51,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:51,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:05:51,841 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 16:05:51,843 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 16:05:51,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:05:51,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:05:51,845 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) [2022-07-14 16:05:51,846 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 [2022-07-14 16:05:51,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:05:51,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:05:51,854 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:05:51,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:05:51,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:05:51,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:05:51,855 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:05:51,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:05:51,871 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:05:51,895 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 [2022-07-14 16:05:51,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:05:51,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:05:51,897 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) [2022-07-14 16:05:51,898 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 [2022-07-14 16:05:51,899 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:05:51,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:05:51,905 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:05:51,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:05:51,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:05:51,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:05:51,910 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:05:51,910 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:05:51,931 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:05:51,948 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 [2022-07-14 16:05:51,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:05:51,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:05:51,954 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) [2022-07-14 16:05:51,958 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 [2022-07-14 16:05:51,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:05:51,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:05:51,966 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:05:51,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:05:51,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:05:51,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:05:51,967 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:05:51,967 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:05:51,983 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:05:52,001 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 [2022-07-14 16:05:52,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:05:52,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:05:52,003 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) [2022-07-14 16:05:52,004 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 [2022-07-14 16:05:52,006 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:05:52,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:05:52,011 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:05:52,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:05:52,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:05:52,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:05:52,012 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:05:52,013 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:05:52,028 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:05:52,046 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 [2022-07-14 16:05:52,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:05:52,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:05:52,048 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) [2022-07-14 16:05:52,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 [2022-07-14 16:05:52,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:05:52,075 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:05:52,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:05:52,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:05:52,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:05:52,076 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:05:52,076 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:05:52,079 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 [2022-07-14 16:05:52,087 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:05:52,105 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 [2022-07-14 16:05:52,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:05:52,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:05:52,107 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) [2022-07-14 16:05:52,108 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 [2022-07-14 16:05:52,109 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:05:52,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:05:52,115 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:05:52,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:05:52,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:05:52,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:05:52,116 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:05:52,116 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:05:52,131 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 16:05:52,134 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-14 16:05:52,134 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-14 16:05:52,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:05:52,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:05:52,137 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) [2022-07-14 16:05:52,138 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 [2022-07-14 16:05:52,141 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 16:05:52,141 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-14 16:05:52,141 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 16:05:52,141 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 11 Supporting invariants [] [2022-07-14 16:05:52,168 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 [2022-07-14 16:05:52,170 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-14 16:05:52,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:05:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:05:52,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 16:05:52,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:05:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:05:52,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 16:05:52,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:05:52,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:05:52,426 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 [2022-07-14 16:05:52,426 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 176 states and 259 transitions. cyclomatic complexity: 84 Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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) [2022-07-14 16:05:52,459 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 176 states and 259 transitions. cyclomatic complexity: 84. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 294 states and 443 transitions. Complement of second has 4 states. [2022-07-14 16:05:52,459 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 [2022-07-14 16:05:52,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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) [2022-07-14 16:05:52,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2022-07-14 16:05:52,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 183 transitions. Stem has 45 letters. Loop has 29 letters. [2022-07-14 16:05:52,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:05:52,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 183 transitions. Stem has 74 letters. Loop has 29 letters. [2022-07-14 16:05:52,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:05:52,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 183 transitions. Stem has 45 letters. Loop has 58 letters. [2022-07-14 16:05:52,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:05:52,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 294 states and 443 transitions. [2022-07-14 16:05:52,466 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 16:05:52,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 294 states to 0 states and 0 transitions. [2022-07-14 16:05:52,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-14 16:05:52,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-14 16:05:52,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-14 16:05:52,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:05:52,467 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 16:05:52,467 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 16:05:52,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:05:52,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 16:05:52,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 16:05:52,468 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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) [2022-07-14 16:05:52,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:05:52,468 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-07-14 16:05:52,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 16:05:52,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-07-14 16:05:52,468 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 16:05:52,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-07-14 16:05:52,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-14 16:05:52,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-14 16:05:52,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-14 16:05:52,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:05:52,469 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 16:05:52,469 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 16:05:52,469 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 16:05:52,469 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 16:05:52,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-14 16:05:52,470 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 16:05:52,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-14 16:05:52,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.07 04:05:52 BoogieIcfgContainer [2022-07-14 16:05:52,474 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-14 16:05:52,475 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 16:05:52,475 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 16:05:52,475 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 16:05:52,475 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:05:49" (3/4) ... [2022-07-14 16:05:52,477 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-14 16:05:52,477 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 16:05:52,478 INFO L158 Benchmark]: Toolchain (without parser) took 3760.13ms. Allocated memory was 121.6MB in the beginning and 180.4MB in the end (delta: 58.7MB). Free memory was 95.5MB in the beginning and 111.6MB in the end (delta: -16.1MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. [2022-07-14 16:05:52,478 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 121.6MB. Free memory is still 78.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 16:05:52,478 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.10ms. Allocated memory is still 121.6MB. Free memory was 95.3MB in the beginning and 90.9MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 16:05:52,479 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.83ms. Allocated memory is still 121.6MB. Free memory was 90.9MB in the beginning and 87.9MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-14 16:05:52,479 INFO L158 Benchmark]: Boogie Preprocessor took 20.99ms. Allocated memory is still 121.6MB. Free memory was 87.9MB in the beginning and 85.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 16:05:52,479 INFO L158 Benchmark]: RCFGBuilder took 516.41ms. Allocated memory was 121.6MB in the beginning and 148.9MB in the end (delta: 27.3MB). Free memory was 85.8MB in the beginning and 123.2MB in the end (delta: -37.5MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. [2022-07-14 16:05:52,480 INFO L158 Benchmark]: BuchiAutomizer took 2936.22ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 123.1MB in the beginning and 111.6MB in the end (delta: 11.5MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. [2022-07-14 16:05:52,480 INFO L158 Benchmark]: Witness Printer took 2.47ms. Allocated memory is still 180.4MB. Free memory is still 111.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 16:05:52,482 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.10ms. Allocated memory is still 121.6MB. Free memory is still 78.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 243.10ms. Allocated memory is still 121.6MB. Free memory was 95.3MB in the beginning and 90.9MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.83ms. Allocated memory is still 121.6MB. Free memory was 90.9MB in the beginning and 87.9MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.99ms. Allocated memory is still 121.6MB. Free memory was 87.9MB in the beginning and 85.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 516.41ms. Allocated memory was 121.6MB in the beginning and 148.9MB in the end (delta: 27.3MB). Free memory was 85.8MB in the beginning and 123.2MB in the end (delta: -37.5MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 2936.22ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 123.1MB in the beginning and 111.6MB in the end (delta: 11.5MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. * Witness Printer took 2.47ms. Allocated memory is still 180.4MB. Free memory is still 111.6MB. There was no memory consumed. 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 -2 * i2 + 11 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 2.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 68 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 465 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 464 mSDsluCounter, 2295 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1507 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55 IncrementalHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 788 mSDtfsCounter, 55 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital133 mio100 ax100 hnf100 lsp28 ukn100 mio100 lsp100 div123 bol100 ite100 ukn100 eq182 hnf86 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-14 16:05:52,515 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 [2022-07-14 16:05:52,720 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE