./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.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 8b0406e617bfcdc7e6543e19b38e9be8eeb37f2896cb91bcfe6035d747328da7 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 10:06:52,814 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 10:06:52,816 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 10:06:52,864 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 10:06:52,864 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 10:06:52,865 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 10:06:52,866 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 10:06:52,867 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 10:06:52,868 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 10:06:52,869 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 10:06:52,869 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 10:06:52,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 10:06:52,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 10:06:52,871 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 10:06:52,872 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 10:06:52,872 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 10:06:52,873 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 10:06:52,873 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 10:06:52,874 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 10:06:52,876 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 10:06:52,877 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 10:06:52,877 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 10:06:52,878 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 10:06:52,879 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 10:06:52,881 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 10:06:52,881 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 10:06:52,881 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 10:06:52,882 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 10:06:52,882 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 10:06:52,883 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 10:06:52,883 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 10:06:52,883 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 10:06:52,884 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 10:06:52,884 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 10:06:52,885 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 10:06:52,885 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 10:06:52,886 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 10:06:52,886 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 10:06:52,886 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 10:06:52,887 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 10:06:52,888 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 10:06:52,888 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-16 10:06:52,902 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 10:06:52,903 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 10:06:52,903 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 10:06:52,903 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 10:06:52,904 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 10:06:52,904 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 10:06:52,904 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 10:06:52,904 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-16 10:06:52,904 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-16 10:06:52,905 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-16 10:06:52,905 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-16 10:06:52,905 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-16 10:06:52,905 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-16 10:06:52,905 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 10:06:52,905 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 10:06:52,906 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 10:06:52,906 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 10:06:52,906 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 10:06:52,906 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 10:06:52,906 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-16 10:06:52,906 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-16 10:06:52,907 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-16 10:06:52,907 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 10:06:52,907 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 10:06:52,907 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-16 10:06:52,907 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 10:06:52,908 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-16 10:06:52,908 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 10:06:52,908 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 10:06:52,908 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 10:06:52,908 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 10:06:52,909 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 10:06:52,909 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-16 10:06:52,909 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 -> 8b0406e617bfcdc7e6543e19b38e9be8eeb37f2896cb91bcfe6035d747328da7 [2021-12-16 10:06:53,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 10:06:53,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 10:06:53,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 10:06:53,104 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 10:06:53,104 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 10:06:53,105 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c [2021-12-16 10:06:53,175 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3309e2d3/436af8b2eabc4085887fdc6d436d81ad/FLAGe3408ff6f [2021-12-16 10:06:53,511 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 10:06:53,511 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c [2021-12-16 10:06:53,521 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3309e2d3/436af8b2eabc4085887fdc6d436d81ad/FLAGe3408ff6f [2021-12-16 10:06:53,909 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3309e2d3/436af8b2eabc4085887fdc6d436d81ad [2021-12-16 10:06:53,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 10:06:53,913 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 10:06:53,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 10:06:53,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 10:06:53,918 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 10:06:53,918 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 10:06:53" (1/1) ... [2021-12-16 10:06:53,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21d297f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:06:53, skipping insertion in model container [2021-12-16 10:06:53,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 10:06:53" (1/1) ... [2021-12-16 10:06:53,926 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 10:06:53,952 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 10:06:54,130 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.1.ufo.BOUNDED-6.pals.c[11348,11361] [2021-12-16 10:06:54,130 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 10:06:54,136 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 10:06:54,173 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.1.ufo.BOUNDED-6.pals.c[11348,11361] [2021-12-16 10:06:54,174 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 10:06:54,199 INFO L208 MainTranslator]: Completed translation [2021-12-16 10:06:54,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:06:54 WrapperNode [2021-12-16 10:06:54,200 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 10:06:54,201 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 10:06:54,201 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 10:06:54,201 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 10:06:54,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:06:54" (1/1) ... [2021-12-16 10:06:54,222 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:06:54" (1/1) ... [2021-12-16 10:06:54,248 INFO L137 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 409 [2021-12-16 10:06:54,251 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 10:06:54,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 10:06:54,253 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 10:06:54,253 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 10:06:54,258 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:06:54" (1/1) ... [2021-12-16 10:06:54,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:06:54" (1/1) ... [2021-12-16 10:06:54,263 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:06:54" (1/1) ... [2021-12-16 10:06:54,263 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:06:54" (1/1) ... [2021-12-16 10:06:54,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:06:54" (1/1) ... [2021-12-16 10:06:54,272 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:06:54" (1/1) ... [2021-12-16 10:06:54,274 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:06:54" (1/1) ... [2021-12-16 10:06:54,279 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 10:06:54,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 10:06:54,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 10:06:54,291 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 10:06:54,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:06:54" (1/1) ... [2021-12-16 10:06:54,300 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:06:54,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:06:54,346 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:06:54,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-16 10:06:54,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 10:06:54,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 10:06:54,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 10:06:54,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 10:06:54,506 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 10:06:54,507 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 10:06:54,898 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 10:06:54,905 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 10:06:54,905 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-16 10:06:54,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 10:06:54 BoogieIcfgContainer [2021-12-16 10:06:54,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 10:06:54,907 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-16 10:06:54,908 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-16 10:06:54,910 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-16 10:06:54,910 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 10:06:54,910 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.12 10:06:53" (1/3) ... [2021-12-16 10:06:54,911 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f06371e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.12 10:06:54, skipping insertion in model container [2021-12-16 10:06:54,911 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 10:06:54,911 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:06:54" (2/3) ... [2021-12-16 10:06:54,912 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f06371e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.12 10:06:54, skipping insertion in model container [2021-12-16 10:06:54,912 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 10:06:54,912 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 10:06:54" (3/3) ... [2021-12-16 10:06:54,913 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.3.1.ufo.BOUNDED-6.pals.c [2021-12-16 10:06:54,939 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-16 10:06:54,940 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-16 10:06:54,940 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-16 10:06:54,940 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-16 10:06:54,940 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-16 10:06:54,940 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-16 10:06:54,941 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-16 10:06:54,941 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-16 10:06:54,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 124 states, 123 states have (on average 1.7398373983739837) internal successors, (214), 123 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:06:54,969 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2021-12-16 10:06:54,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:06:54,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:06:54,983 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:06:54,983 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:06:54,983 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-16 10:06:54,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 124 states, 123 states have (on average 1.7398373983739837) internal successors, (214), 123 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:06:54,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2021-12-16 10:06:54,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:06:54,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:06:54,993 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:06:54,993 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:06:54,999 INFO L791 eck$LassoCheckResult]: Stem: 115#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; 43#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; 93#L228true assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 48#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); 58#L254true assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 62#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; 17#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; 79#L283-1true init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 114#L293true assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 77#L296-1true init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 123#L306true assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 111#L306-1true init_#res#1 := init_~tmp___5~0#1; 91#L391true 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; 102#L485true assume !(0 == main_~i2~0#1); 7#L485-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; 53#L499-2true [2021-12-16 10:06:55,000 INFO L793 eck$LassoCheckResult]: Loop: 53#L499-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); 64#L100true assume !(~r1~0 < 2); 82#L100-1true ~mode1~0 := 1; 112#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); 94#L143-1true ~mode2~0 := 1; 65#L118-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 15#L161true assume !(0 != ~mode3~0 % 256); 71#L186true assume !(~r3~0 < 2); 27#L186-1true ~mode3~0 := 1; 6#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; 75#L399true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 120#L399-1true check_#res#1 := check_~tmp~1#1; 30#L447true 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; 98#L529true assume !(0 == assert_~arg#1 % 256); 28#L524true 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; 53#L499-2true [2021-12-16 10:06:55,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:06:55,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1693212754, now seen corresponding path program 1 times [2021-12-16 10:06:55,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:06:55,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431240463] [2021-12-16 10:06:55,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:06:55,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:06:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:06:55,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 10:06:55,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:06:55,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431240463] [2021-12-16 10:06:55,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431240463] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:06:55,239 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:06:55,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 10:06:55,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243990771] [2021-12-16 10:06:55,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:06:55,244 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 10:06:55,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:06:55,246 INFO L85 PathProgramCache]: Analyzing trace with hash 2071749167, now seen corresponding path program 1 times [2021-12-16 10:06:55,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:06:55,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602718027] [2021-12-16 10:06:55,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:06:55,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:06:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:06:55,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 10:06:55,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:06:55,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602718027] [2021-12-16 10:06:55,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602718027] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:06:55,351 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:06:55,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 10:06:55,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948350316] [2021-12-16 10:06:55,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:06:55,353 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 10:06:55,353 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:06:55,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 10:06:55,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 10:06:55,374 INFO L87 Difference]: Start difference. First operand has 124 states, 123 states have (on average 1.7398373983739837) internal successors, (214), 123 states have internal predecessors, (214), 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) [2021-12-16 10:06:55,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:06:55,443 INFO L93 Difference]: Finished difference Result 128 states and 214 transitions. [2021-12-16 10:06:55,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 10:06:55,447 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 214 transitions. [2021-12-16 10:06:55,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2021-12-16 10:06:55,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 119 states and 198 transitions. [2021-12-16 10:06:55,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2021-12-16 10:06:55,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2021-12-16 10:06:55,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 198 transitions. [2021-12-16 10:06:55,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:06:55,455 INFO L681 BuchiCegarLoop]: Abstraction has 119 states and 198 transitions. [2021-12-16 10:06:55,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 198 transitions. [2021-12-16 10:06:55,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-12-16 10:06:55,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 119 states have (on average 1.6638655462184875) internal successors, (198), 118 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:06:55,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 198 transitions. [2021-12-16 10:06:55,490 INFO L704 BuchiCegarLoop]: Abstraction has 119 states and 198 transitions. [2021-12-16 10:06:55,490 INFO L587 BuchiCegarLoop]: Abstraction has 119 states and 198 transitions. [2021-12-16 10:06:55,490 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-16 10:06:55,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 198 transitions. [2021-12-16 10:06:55,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2021-12-16 10:06:55,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:06:55,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:06:55,493 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:06:55,493 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:06:55,493 INFO L791 eck$LassoCheckResult]: Stem: 387#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; 338#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; 339#L228 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 345#L231-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 325#L241 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 285#L244-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 323#L254 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 333#L257-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 318#L267 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 291#L270-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 302#L280 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 365#L283-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 371#L293 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 335#L296-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 370#L306 assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 272#L306-1 init_#res#1 := init_~tmp___5~0#1; 379#L391 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; 380#L485 assume !(0 == main_~i2~0#1); 277#L485-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; 278#L499-2 [2021-12-16 10:06:55,494 INFO L793 eck$LassoCheckResult]: Loop: 278#L499-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 352#L75 assume !(0 != ~mode1~0 % 256); 360#L100 assume !(~r1~0 < 2); 340#L100-1 ~mode1~0 := 1; 315#L75-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 381#L118 assume !(0 != ~mode2~0 % 256); 382#L143 assume !(~r2~0 < 2); 336#L143-1 ~mode2~0 := 1; 362#L118-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 296#L161 assume !(0 != ~mode3~0 % 256); 297#L186 assume !(~r3~0 < 2); 319#L186-1 ~mode3~0 := 1; 275#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; 276#L399 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 369#L400 assume ~st1~0 + ~nl1~0 <= 1; 287#L401 assume ~st2~0 + ~nl2~0 <= 1; 288#L402 assume ~st3~0 + ~nl3~0 <= 1; 355#L403 assume ~r1~0 >= 2; 299#L407 assume ~r1~0 < 2; 300#L412 assume ~r1~0 >= 2; 306#L417 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 327#L399-1 check_#res#1 := check_~tmp~1#1; 321#L447 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; 322#L529 assume !(0 == assert_~arg#1 % 256); 320#L524 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; 278#L499-2 [2021-12-16 10:06:55,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:06:55,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1693212754, now seen corresponding path program 2 times [2021-12-16 10:06:55,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:06:55,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829113597] [2021-12-16 10:06:55,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:06:55,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:06:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:06:55,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 10:06:55,532 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:06:55,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829113597] [2021-12-16 10:06:55,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829113597] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:06:55,533 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:06:55,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 10:06:55,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758985626] [2021-12-16 10:06:55,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:06:55,534 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 10:06:55,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:06:55,535 INFO L85 PathProgramCache]: Analyzing trace with hash -980587296, now seen corresponding path program 1 times [2021-12-16 10:06:55,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:06:55,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704684007] [2021-12-16 10:06:55,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:06:55,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:06:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:06:55,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 10:06:55,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:06:55,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704684007] [2021-12-16 10:06:55,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704684007] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:06:55,575 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:06:55,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 10:06:55,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480676959] [2021-12-16 10:06:55,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:06:55,576 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 10:06:55,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:06:55,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 10:06:55,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 10:06:55,577 INFO L87 Difference]: Start difference. First operand 119 states and 198 transitions. cyclomatic complexity: 80 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) [2021-12-16 10:06:55,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:06:55,642 INFO L93 Difference]: Finished difference Result 190 states and 308 transitions. [2021-12-16 10:06:55,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 10:06:55,643 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 190 states and 308 transitions. [2021-12-16 10:06:55,645 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2021-12-16 10:06:55,649 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 190 states to 187 states and 285 transitions. [2021-12-16 10:06:55,651 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 187 [2021-12-16 10:06:55,651 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 187 [2021-12-16 10:06:55,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 187 states and 285 transitions. [2021-12-16 10:06:55,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:06:55,653 INFO L681 BuchiCegarLoop]: Abstraction has 187 states and 285 transitions. [2021-12-16 10:06:55,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states and 285 transitions. [2021-12-16 10:06:55,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 119. [2021-12-16 10:06:55,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 119 states have (on average 1.4873949579831933) internal successors, (177), 118 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:06:55,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 177 transitions. [2021-12-16 10:06:55,662 INFO L704 BuchiCegarLoop]: Abstraction has 119 states and 177 transitions. [2021-12-16 10:06:55,663 INFO L587 BuchiCegarLoop]: Abstraction has 119 states and 177 transitions. [2021-12-16 10:06:55,663 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-16 10:06:55,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 177 transitions. [2021-12-16 10:06:55,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2021-12-16 10:06:55,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:06:55,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:06:55,665 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:06:55,665 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:06:55,665 INFO L791 eck$LassoCheckResult]: Stem: 709#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; 660#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; 661#L228 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 667#L231-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 647#L241 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 608#L244-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 644#L254 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 655#L257-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 639#L267 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 612#L270-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 623#L280 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 687#L283-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 694#L293 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 657#L296-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 692#L306 assume ~id1~0 != ~id2~0; 696#L307 assume ~id1~0 != ~id3~0; 615#L308 assume ~id2~0 != ~id3~0; 616#L309 assume ~id1~0 >= 0; 695#L310 assume ~id2~0 >= 0; 672#L311 assume ~id3~0 >= 0; 673#L312 assume 0 == ~r1~0; 637#L313 assume 0 == ~r2~0; 638#L314 assume 0 == ~r3~0; 665#L315 assume ~max1~0 == ~id1~0; 666#L316 assume ~max2~0 == ~id2~0; 594#L317 assume ~max3~0 == ~id3~0; 595#L318 assume 0 == ~st1~0; 710#L319 assume 0 == ~st2~0; 700#L320 assume 0 == ~st3~0; 689#L321 assume 0 == ~nl1~0; 690#L322 assume 0 == ~nl2~0; 592#L323 assume 0 == ~nl3~0; 593#L324 assume 0 == ~mode1~0 % 256; 624#L325 assume 0 == ~mode2~0 % 256; 645#L326 assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; 646#L306-1 init_#res#1 := init_~tmp___5~0#1; 701#L391 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; 702#L485 assume !(0 == main_~i2~0#1); 598#L485-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; 599#L499-2 [2021-12-16 10:06:55,666 INFO L793 eck$LassoCheckResult]: Loop: 599#L499-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 674#L75 assume !(0 != ~mode1~0 % 256); 682#L100 assume !(~r1~0 < 2); 662#L100-1 ~mode1~0 := 1; 636#L75-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 703#L118 assume !(0 != ~mode2~0 % 256); 704#L143 assume !(~r2~0 < 2); 658#L143-1 ~mode2~0 := 1; 684#L118-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 617#L161 assume !(0 != ~mode3~0 % 256); 618#L186 assume !(~r3~0 < 2); 640#L186-1 ~mode3~0 := 1; 596#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; 597#L399 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 691#L400 assume ~st1~0 + ~nl1~0 <= 1; 605#L401 assume ~st2~0 + ~nl2~0 <= 1; 606#L402 assume ~st3~0 + ~nl3~0 <= 1; 677#L403 assume ~r1~0 >= 2; 620#L407 assume ~r1~0 < 2; 621#L412 assume ~r1~0 >= 2; 627#L417 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 649#L399-1 check_#res#1 := check_~tmp~1#1; 642#L447 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; 643#L529 assume !(0 == assert_~arg#1 % 256); 641#L524 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; 599#L499-2 [2021-12-16 10:06:55,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:06:55,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1849055478, now seen corresponding path program 1 times [2021-12-16 10:06:55,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:06:55,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174531201] [2021-12-16 10:06:55,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:06:55,667 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:06:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:06:55,685 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:06:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:06:55,734 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:06:55,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:06:55,735 INFO L85 PathProgramCache]: Analyzing trace with hash -980587296, now seen corresponding path program 2 times [2021-12-16 10:06:55,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:06:55,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929996479] [2021-12-16 10:06:55,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:06:55,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:06:55,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:06:55,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 10:06:55,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:06:55,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929996479] [2021-12-16 10:06:55,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929996479] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:06:55,756 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:06:55,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 10:06:55,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946317867] [2021-12-16 10:06:55,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:06:55,757 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 10:06:55,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:06:55,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 10:06:55,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 10:06:55,757 INFO L87 Difference]: Start difference. First operand 119 states and 177 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) [2021-12-16 10:06:55,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:06:55,792 INFO L93 Difference]: Finished difference Result 171 states and 254 transitions. [2021-12-16 10:06:55,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 10:06:55,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 171 states and 254 transitions. [2021-12-16 10:06:55,794 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 120 [2021-12-16 10:06:55,795 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 171 states to 171 states and 254 transitions. [2021-12-16 10:06:55,795 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 171 [2021-12-16 10:06:55,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 171 [2021-12-16 10:06:55,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 254 transitions. [2021-12-16 10:06:55,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:06:55,796 INFO L681 BuchiCegarLoop]: Abstraction has 171 states and 254 transitions. [2021-12-16 10:06:55,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 254 transitions. [2021-12-16 10:06:55,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2021-12-16 10:06:55,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 171 states have (on average 1.4853801169590644) internal successors, (254), 170 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:06:55,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 254 transitions. [2021-12-16 10:06:55,801 INFO L704 BuchiCegarLoop]: Abstraction has 171 states and 254 transitions. [2021-12-16 10:06:55,801 INFO L587 BuchiCegarLoop]: Abstraction has 171 states and 254 transitions. [2021-12-16 10:06:55,801 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-16 10:06:55,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 171 states and 254 transitions. [2021-12-16 10:06:55,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 120 [2021-12-16 10:06:55,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:06:55,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:06:55,803 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:06:55,803 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:06:55,803 INFO L791 eck$LassoCheckResult]: Stem: 1016#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; 959#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; 960#L228 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 966#L231-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 944#L241 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 904#L244-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 941#L254 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 952#L257-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 935#L267 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 908#L270-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 918#L280 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 988#L283-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 996#L293 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 954#L296-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 994#L306 assume ~id1~0 != ~id2~0; 998#L307 assume ~id1~0 != ~id3~0; 911#L308 assume ~id2~0 != ~id3~0; 912#L309 assume ~id1~0 >= 0; 997#L310 assume ~id2~0 >= 0; 971#L311 assume ~id3~0 >= 0; 972#L312 assume 0 == ~r1~0; 933#L313 assume 0 == ~r2~0; 934#L314 assume 0 == ~r3~0; 964#L315 assume ~max1~0 == ~id1~0; 965#L316 assume ~max2~0 == ~id2~0; 890#L317 assume ~max3~0 == ~id3~0; 891#L318 assume 0 == ~st1~0; 1019#L319 assume 0 == ~st2~0; 1002#L320 assume 0 == ~st3~0; 991#L321 assume 0 == ~nl1~0; 992#L322 assume 0 == ~nl2~0; 888#L323 assume 0 == ~nl3~0; 889#L324 assume 0 == ~mode1~0 % 256; 919#L325 assume 0 == ~mode2~0 % 256; 942#L326 assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; 943#L306-1 init_#res#1 := init_~tmp___5~0#1; 1003#L391 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; 1004#L485 assume !(0 == main_~i2~0#1); 894#L485-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; 895#L499-2 [2021-12-16 10:06:55,804 INFO L793 eck$LassoCheckResult]: Loop: 895#L499-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 1048#L75 assume !(0 != ~mode1~0 % 256); 1047#L100 assume ~r1~0 < 2; 1017#L101 assume !(0 != ~ep12~0 % 256); 963#L101-2 assume !(0 != ~ep13~0 % 256); 961#L100-1 ~mode1~0 := 1; 932#L75-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 1046#L118 assume !(0 != ~mode2~0 % 256); 1010#L143 assume !(~r2~0 < 2); 955#L143-1 ~mode2~0 := 1; 1033#L118-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 1031#L161 assume !(0 != ~mode3~0 % 256); 1028#L186 assume !(~r3~0 < 2); 936#L186-1 ~mode3~0 := 1; 892#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; 893#L399 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 993#L400 assume ~st1~0 + ~nl1~0 <= 1; 901#L401 assume ~st2~0 + ~nl2~0 <= 1; 902#L402 assume ~st3~0 + ~nl3~0 <= 1; 1021#L403 assume !(~r1~0 >= 2); 956#L406 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 957#L407 assume ~r1~0 < 2; 1020#L412 assume !(~r1~0 >= 2); 922#L416 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 923#L417 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 1052#L399-1 check_#res#1 := check_~tmp~1#1; 1051#L447 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; 1050#L529 assume !(0 == assert_~arg#1 % 256); 1049#L524 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; 895#L499-2 [2021-12-16 10:06:55,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:06:55,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1849055478, now seen corresponding path program 2 times [2021-12-16 10:06:55,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:06:55,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763380923] [2021-12-16 10:06:55,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:06:55,805 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:06:55,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:06:55,818 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:06:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:06:55,874 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:06:55,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:06:55,874 INFO L85 PathProgramCache]: Analyzing trace with hash 365017361, now seen corresponding path program 1 times [2021-12-16 10:06:55,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:06:55,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612616650] [2021-12-16 10:06:55,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:06:55,875 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:06:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:06:55,889 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:06:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:06:55,904 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:06:55,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:06:55,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1685413828, now seen corresponding path program 1 times [2021-12-16 10:06:55,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:06:55,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109958343] [2021-12-16 10:06:55,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:06:55,905 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:06:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:06:55,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 10:06:55,958 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:06:55,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109958343] [2021-12-16 10:06:55,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109958343] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:06:55,959 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:06:55,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 10:06:55,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128393529] [2021-12-16 10:06:55,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:06:56,393 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 10:06:56,394 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 10:06:56,394 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 10:06:56,394 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 10:06:56,394 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-16 10:06:56,394 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:06:56,394 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 10:06:56,394 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 10:06:56,394 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2021-12-16 10:06:56,394 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 10:06:56,395 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 10:06:56,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:56,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:56,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:56,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:56,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:56,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:56,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:56,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:56,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:56,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:56,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:56,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:56,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:56,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:56,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:56,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:56,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:56,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:56,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:56,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:56,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:56,752 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 10:06:56,753 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-16 10:06:56,754 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:06:56,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:06:56,758 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:06:56,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-16 10:06:56,763 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 10:06:56,763 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 10:06:56,781 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 10:06:56,781 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~ep12~0=0} Honda state: {~ep12~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-16 10:06:56,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-12-16 10:06:56,798 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:06:56,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:06:56,799 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:06:56,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-16 10:06:56,811 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 10:06:56,812 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 10:06:56,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-16 10:06:56,837 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:06:56,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:06:56,838 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:06:56,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-16 10:06:56,845 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-16 10:06:56,845 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 10:06:56,972 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-16 10:06:56,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2021-12-16 10:06:56,976 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 10:06:56,976 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 10:06:56,976 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 10:06:56,976 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 10:06:56,976 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 10:06:56,976 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:06:56,976 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 10:06:56,976 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 10:06:56,976 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2021-12-16 10:06:56,976 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 10:06:56,976 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 10:06:56,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:56,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:56,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:57,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:57,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:57,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:57,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:57,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:57,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:57,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:57,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:57,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:57,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:57,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:57,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:57,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:57,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:57,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:57,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:57,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:57,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:06:57,330 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 10:06:57,333 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 10:06:57,333 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:06:57,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:06:57,345 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:06:57,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-16 10:06:57,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:06:57,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:06:57,371 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:06:57,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:06:57,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:06:57,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:06:57,373 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:06:57,373 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:06:57,387 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:06:57,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-16 10:06:57,418 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:06:57,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:06:57,430 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:06:57,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-16 10:06:57,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:06:57,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:06:57,439 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:06:57,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:06:57,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:06:57,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:06:57,443 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:06:57,443 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:06:57,463 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:06:57,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2021-12-16 10:06:57,481 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:06:57,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:06:57,482 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:06:57,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-16 10:06:57,484 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:06:57,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:06:57,490 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:06:57,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:06:57,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:06:57,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:06:57,492 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:06:57,492 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:06:57,507 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:06:57,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-16 10:06:57,525 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:06:57,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:06:57,531 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:06:57,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-12-16 10:06:57,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:06:57,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:06:57,563 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:06:57,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:06:57,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:06:57,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:06:57,564 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:06:57,564 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:06:57,576 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:06:57,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-12-16 10:06:57,594 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:06:57,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:06:57,595 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:06:57,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-12-16 10:06:57,597 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:06:57,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:06:57,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:06:57,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:06:57,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:06:57,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:06:57,604 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:06:57,604 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:06:57,615 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:06:57,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2021-12-16 10:06:57,632 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:06:57,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:06:57,633 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:06:57,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-16 10:06:57,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:06:57,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:06:57,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:06:57,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:06:57,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:06:57,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:06:57,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:06:57,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:06:57,645 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 10:06:57,649 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-16 10:06:57,649 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-16 10:06:57,650 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:06:57,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:06:57,651 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:06:57,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-12-16 10:06:57,653 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 10:06:57,653 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-16 10:06:57,653 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 10:06:57,653 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 [] [2021-12-16 10:06:57,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-12-16 10:06:57,671 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-16 10:06:57,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:06:57,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:06:57,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 10:06:57,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-12-16 10:06:57,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 10:06:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:06:57,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 10:06:57,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 10:06:57,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 10:06:57,992 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-16 10:06:57,992 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 171 states and 254 transitions. cyclomatic complexity: 84 Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:06:58,020 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 171 states and 254 transitions. cyclomatic complexity: 84. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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 290 states and 439 transitions. Complement of second has 4 states. [2021-12-16 10:06:58,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-12-16 10:06:58,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:06:58,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2021-12-16 10:06:58,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 177 transitions. Stem has 39 letters. Loop has 29 letters. [2021-12-16 10:06:58,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 10:06:58,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 177 transitions. Stem has 68 letters. Loop has 29 letters. [2021-12-16 10:06:58,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 10:06:58,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 177 transitions. Stem has 39 letters. Loop has 58 letters. [2021-12-16 10:06:58,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 10:06:58,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 290 states and 439 transitions. [2021-12-16 10:06:58,026 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-16 10:06:58,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 290 states to 0 states and 0 transitions. [2021-12-16 10:06:58,026 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-12-16 10:06:58,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-12-16 10:06:58,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-12-16 10:06:58,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:06:58,026 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-16 10:06:58,026 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-16 10:06:58,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:06:58,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 10:06:58,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 10:06:58,027 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:06:58,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:06:58,027 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-12-16 10:06:58,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-16 10:06:58,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2021-12-16 10:06:58,027 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-16 10:06:58,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2021-12-16 10:06:58,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-12-16 10:06:58,027 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-12-16 10:06:58,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-12-16 10:06:58,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:06:58,027 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-16 10:06:58,028 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-16 10:06:58,028 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-16 10:06:58,028 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-16 10:06:58,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-12-16 10:06:58,028 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-16 10:06:58,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-12-16 10:06:58,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.12 10:06:58 BoogieIcfgContainer [2021-12-16 10:06:58,032 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-16 10:06:58,032 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 10:06:58,032 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 10:06:58,032 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 10:06:58,033 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 10:06:54" (3/4) ... [2021-12-16 10:06:58,034 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-16 10:06:58,035 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 10:06:58,035 INFO L158 Benchmark]: Toolchain (without parser) took 4121.77ms. Allocated memory was 127.9MB in the beginning and 180.4MB in the end (delta: 52.4MB). Free memory was 92.8MB in the beginning and 118.1MB in the end (delta: -25.3MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2021-12-16 10:06:58,035 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 75.5MB. Free memory is still 35.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 10:06:58,035 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.52ms. Allocated memory is still 127.9MB. Free memory was 92.3MB in the beginning and 97.2MB in the end (delta: -4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-16 10:06:58,036 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.53ms. Allocated memory is still 127.9MB. Free memory was 97.2MB in the beginning and 94.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 10:06:58,036 INFO L158 Benchmark]: Boogie Preprocessor took 27.01ms. Allocated memory is still 127.9MB. Free memory was 94.5MB in the beginning and 92.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 10:06:58,036 INFO L158 Benchmark]: RCFGBuilder took 616.38ms. Allocated memory is still 127.9MB. Free memory was 92.5MB in the beginning and 70.1MB in the end (delta: 22.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-12-16 10:06:58,037 INFO L158 Benchmark]: BuchiAutomizer took 3124.51ms. Allocated memory was 127.9MB in the beginning and 180.4MB in the end (delta: 52.4MB). Free memory was 69.4MB in the beginning and 118.1MB in the end (delta: -48.7MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. [2021-12-16 10:06:58,037 INFO L158 Benchmark]: Witness Printer took 2.34ms. Allocated memory is still 180.4MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 10:06:58,038 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.14ms. Allocated memory is still 75.5MB. Free memory is still 35.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 284.52ms. Allocated memory is still 127.9MB. Free memory was 92.3MB in the beginning and 97.2MB in the end (delta: -4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.53ms. Allocated memory is still 127.9MB. Free memory was 97.2MB in the beginning and 94.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.01ms. Allocated memory is still 127.9MB. Free memory was 94.5MB in the beginning and 92.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 616.38ms. Allocated memory is still 127.9MB. Free memory was 92.5MB in the beginning and 70.1MB in the end (delta: 22.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 3124.51ms. Allocated memory was 127.9MB in the beginning and 180.4MB in the end (delta: 52.4MB). Free memory was 69.4MB in the beginning and 118.1MB in the end (delta: -48.7MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. * Witness Printer took 2.34ms. Allocated memory is still 180.4MB. Free memory is still 118.1MB. 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 3.0s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 2.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. 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 171 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 462 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 461 mSDsluCounter, 2186 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1433 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 54 IncrementalHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 753 mSDtfsCounter, 54 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital131 mio100 ax100 hnf100 lsp29 ukn100 mio100 lsp100 div123 bol100 ite100 ukn100 eq182 hnf86 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 54ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-12-16 10:06:58,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE