./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 791161d1 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_opt-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 c6267d36e2eda753e26c9c989bedb16747ddf010783b33bee2d0cb2d2001d5ce --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 15:51:37,885 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 15:51:37,887 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 15:51:37,927 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 15:51:37,927 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 15:51:37,929 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 15:51:37,930 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 15:51:37,935 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 15:51:37,937 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 15:51:37,941 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 15:51:37,942 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 15:51:37,943 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 15:51:37,944 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 15:51:37,946 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 15:51:37,947 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 15:51:37,950 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 15:51:37,950 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 15:51:37,952 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 15:51:37,953 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 15:51:37,958 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 15:51:37,960 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 15:51:37,961 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 15:51:37,961 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 15:51:37,962 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 15:51:37,963 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 15:51:37,970 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 15:51:37,970 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 15:51:37,970 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 15:51:37,971 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 15:51:37,972 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 15:51:37,973 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 15:51:37,973 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 15:51:37,974 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 15:51:37,975 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 15:51:37,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 15:51:37,976 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 15:51:37,976 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 15:51:37,977 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 15:51:37,977 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 15:51:37,977 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 15:51:37,978 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 15:51:37,979 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 15:51:37,981 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-23 15:51:38,015 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 15:51:38,016 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 15:51:38,017 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 15:51:38,017 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 15:51:38,018 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 15:51:38,019 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 15:51:38,019 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 15:51:38,019 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-23 15:51:38,019 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-23 15:51:38,020 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-23 15:51:38,020 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-23 15:51:38,020 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-23 15:51:38,020 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-23 15:51:38,021 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 15:51:38,021 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 15:51:38,021 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 15:51:38,021 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 15:51:38,021 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 15:51:38,021 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 15:51:38,022 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-23 15:51:38,022 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-23 15:51:38,022 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-23 15:51:38,022 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 15:51:38,022 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 15:51:38,023 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-23 15:51:38,023 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 15:51:38,023 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-23 15:51:38,023 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 15:51:38,023 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 15:51:38,024 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 15:51:38,024 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 15:51:38,025 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-23 15:51:38,025 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 -> c6267d36e2eda753e26c9c989bedb16747ddf010783b33bee2d0cb2d2001d5ce [2022-07-23 15:51:38,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 15:51:38,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 15:51:38,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 15:51:38,299 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 15:51:38,300 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 15:51:38,301 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c [2022-07-23 15:51:38,370 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22633dedc/aa5f979e81844bf5a2cd16f22d9b4bbb/FLAG67a73f97d [2022-07-23 15:51:38,768 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 15:51:38,768 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c [2022-07-23 15:51:38,778 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22633dedc/aa5f979e81844bf5a2cd16f22d9b4bbb/FLAG67a73f97d [2022-07-23 15:51:39,161 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22633dedc/aa5f979e81844bf5a2cd16f22d9b4bbb [2022-07-23 15:51:39,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 15:51:39,164 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 15:51:39,165 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 15:51:39,165 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 15:51:39,168 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 15:51:39,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 03:51:39" (1/1) ... [2022-07-23 15:51:39,170 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@613e2362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:51:39, skipping insertion in model container [2022-07-23 15:51:39,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 03:51:39" (1/1) ... [2022-07-23 15:51:39,176 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 15:51:39,206 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 15:51:39,448 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_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c[12747,12760] [2022-07-23 15:51:39,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 15:51:39,464 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 15:51:39,520 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_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c[12747,12760] [2022-07-23 15:51:39,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 15:51:39,547 INFO L208 MainTranslator]: Completed translation [2022-07-23 15:51:39,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:51:39 WrapperNode [2022-07-23 15:51:39,547 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 15:51:39,548 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 15:51:39,548 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 15:51:39,548 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 15:51:39,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:51:39" (1/1) ... [2022-07-23 15:51:39,570 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:51:39" (1/1) ... [2022-07-23 15:51:39,603 INFO L137 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 445 [2022-07-23 15:51:39,604 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 15:51:39,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 15:51:39,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 15:51:39,605 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 15:51:39,616 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:51:39" (1/1) ... [2022-07-23 15:51:39,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:51:39" (1/1) ... [2022-07-23 15:51:39,620 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:51:39" (1/1) ... [2022-07-23 15:51:39,620 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:51:39" (1/1) ... [2022-07-23 15:51:39,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:51:39" (1/1) ... [2022-07-23 15:51:39,633 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:51:39" (1/1) ... [2022-07-23 15:51:39,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:51:39" (1/1) ... [2022-07-23 15:51:39,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 15:51:39,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 15:51:39,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 15:51:39,642 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 15:51:39,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:51:39" (1/1) ... [2022-07-23 15:51:39,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:51:39,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:51:39,675 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:51:39,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-23 15:51:39,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 15:51:39,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 15:51:39,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 15:51:39,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 15:51:39,792 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 15:51:39,794 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 15:51:40,244 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 15:51:40,251 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 15:51:40,251 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-23 15:51:40,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:51:40 BoogieIcfgContainer [2022-07-23 15:51:40,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 15:51:40,254 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-23 15:51:40,254 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-23 15:51:40,261 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-23 15:51:40,261 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 15:51:40,262 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.07 03:51:39" (1/3) ... [2022-07-23 15:51:40,262 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60a6a72c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 03:51:40, skipping insertion in model container [2022-07-23 15:51:40,263 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 15:51:40,263 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:51:39" (2/3) ... [2022-07-23 15:51:40,263 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60a6a72c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 03:51:40, skipping insertion in model container [2022-07-23 15:51:40,263 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 15:51:40,263 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:51:40" (3/3) ... [2022-07-23 15:51:40,265 INFO L354 chiAutomizerObserver]: Analyzing ICFG pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c [2022-07-23 15:51:40,318 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-23 15:51:40,318 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-23 15:51:40,318 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-23 15:51:40,318 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-23 15:51:40,318 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-23 15:51:40,318 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-23 15:51:40,318 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-23 15:51:40,319 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-23 15:51:40,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 136 states, 135 states have (on average 1.7407407407407407) internal successors, (235), 135 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:51:40,354 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2022-07-23 15:51:40,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:51:40,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:51:40,363 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:51:40,364 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:51:40,364 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-23 15:51:40,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 136 states, 135 states have (on average 1.7407407407407407) internal successors, (235), 135 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:51:40,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2022-07-23 15:51:40,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:51:40,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:51:40,378 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:51:40,379 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:51:40,386 INFO L752 eck$LassoCheckResult]: Stem: 124#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(43, 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;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; 41#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~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#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;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#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; 19#L255true assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 8#L258-1true init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 21#L268true assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 25#L271-1true init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 12#L281true assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 47#L284-1true init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 118#L294true assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 33#L297-1true init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 74#L307true assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 75#L310-1true init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 78#L320true assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 86#L323-1true init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 62#L333true assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 114#L333-1true init_#res#1 := init_~tmp___5~0#1; 16#L430true main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1; 91#L527true assume !(0 == main_~i2~0#1); 119#L527-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; 18#L541-2true [2022-07-23 15:51:40,394 INFO L754 eck$LassoCheckResult]: Loop: 18#L541-2true assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 52#L79true assume !(0 != ~mode1~0 % 256); 129#L107true assume !(~r1~0 < 2); 125#L107-1true ~mode1~0 := 1; 39#L79-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 57#L130true assume !(0 != ~mode2~0 % 256); 14#L158true assume !(~r2~0 < 2); 89#L158-1true ~mode2~0 := 1; 54#L130-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 94#L181true assume !(0 != ~mode3~0 % 256); 113#L209true assume !(~r3~0 < 2); 136#L209-1true ~mode3~0 := 1; 46#L181-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; 92#L438true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 43#L438-1true check_#res#1 := check_~tmp~1#1; 97#L486true main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; 127#L571true assume !(0 == assert_~arg#1 % 256); 115#L566true assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; 18#L541-2true [2022-07-23 15:51:40,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:51:40,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1710390244, now seen corresponding path program 1 times [2022-07-23 15:51:40,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:51:40,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587299765] [2022-07-23 15:51:40,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:51:40,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:51:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:51:40,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:51:40,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:51:40,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587299765] [2022-07-23 15:51:40,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587299765] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:51:40,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:51:40,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 15:51:40,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792481070] [2022-07-23 15:51:40,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:51:40,653 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 15:51:40,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:51:40,656 INFO L85 PathProgramCache]: Analyzing trace with hash -365412558, now seen corresponding path program 1 times [2022-07-23 15:51:40,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:51:40,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593686889] [2022-07-23 15:51:40,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:51:40,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:51:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:51:40,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:51:40,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:51:40,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593686889] [2022-07-23 15:51:40,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593686889] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:51:40,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:51:40,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 15:51:40,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017350782] [2022-07-23 15:51:40,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:51:40,802 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 15:51:40,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 15:51:40,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 15:51:40,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 15:51:40,834 INFO L87 Difference]: Start difference. First operand has 136 states, 135 states have (on average 1.7407407407407407) internal successors, (235), 135 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:51:40,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 15:51:40,943 INFO L93 Difference]: Finished difference Result 140 states and 235 transitions. [2022-07-23 15:51:40,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 15:51:40,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 235 transitions. [2022-07-23 15:51:40,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2022-07-23 15:51:40,965 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 131 states and 219 transitions. [2022-07-23 15:51:40,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 131 [2022-07-23 15:51:40,967 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 131 [2022-07-23 15:51:40,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 219 transitions. [2022-07-23 15:51:40,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 15:51:40,968 INFO L369 hiAutomatonCegarLoop]: Abstraction has 131 states and 219 transitions. [2022-07-23 15:51:40,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 219 transitions. [2022-07-23 15:51:40,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-07-23 15:51:40,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 131 states have (on average 1.6717557251908397) internal successors, (219), 130 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:51:40,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 219 transitions. [2022-07-23 15:51:40,995 INFO L392 hiAutomatonCegarLoop]: Abstraction has 131 states and 219 transitions. [2022-07-23 15:51:40,995 INFO L374 stractBuchiCegarLoop]: Abstraction has 131 states and 219 transitions. [2022-07-23 15:51:40,995 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-23 15:51:40,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 219 transitions. [2022-07-23 15:51:40,998 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2022-07-23 15:51:40,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:51:40,998 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:51:40,999 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:51:40,999 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:51:40,999 INFO L752 eck$LassoCheckResult]: Stem: 424#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(43, 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;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; 361#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~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#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;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#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; 324#L255 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 307#L258-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 308#L268 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 332#L271-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 313#L281 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 314#L284-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 368#L294 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 348#L297-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 352#L307 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 370#L310-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 400#L320 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 298#L323-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 389#L333 assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 339#L333-1 init_#res#1 := init_~tmp___5~0#1; 318#L430 main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1; 319#L527 assume !(0 == main_~i2~0#1); 412#L527-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; 322#L541-2 [2022-07-23 15:51:41,000 INFO L754 eck$LassoCheckResult]: Loop: 322#L541-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 323#L79 assume !(0 != ~mode1~0 % 256); 377#L107 assume !(~r1~0 < 2); 374#L107-1 ~mode1~0 := 1; 321#L79-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 360#L130 assume !(0 != ~mode2~0 % 256); 316#L158 assume !(~r2~0 < 2); 311#L158-1 ~mode2~0 := 1; 382#L130-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 383#L181 assume !(0 != ~mode3~0 % 256); 413#L209 assume !(~r3~0 < 2); 345#L209-1 ~mode3~0 := 1; 327#L181-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; 367#L438 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 380#L439 assume ~st1~0 + ~nl1~0 <= 1; 381#L440 assume ~st2~0 + ~nl2~0 <= 1; 330#L441 assume ~st3~0 + ~nl3~0 <= 1; 331#L442 assume ~r1~0 >= 2; 340#L446 assume ~r1~0 < 2; 411#L451 assume ~r1~0 >= 2; 295#L456 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 363#L438-1 check_#res#1 := check_~tmp~1#1; 364#L486 main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; 415#L571 assume !(0 == assert_~arg#1 % 256); 421#L566 assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; 322#L541-2 [2022-07-23 15:51:41,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:51:41,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1710390244, now seen corresponding path program 2 times [2022-07-23 15:51:41,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:51:41,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107091413] [2022-07-23 15:51:41,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:51:41,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:51:41,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:51:41,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:51:41,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:51:41,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107091413] [2022-07-23 15:51:41,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107091413] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:51:41,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:51:41,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 15:51:41,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142639340] [2022-07-23 15:51:41,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:51:41,066 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 15:51:41,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:51:41,067 INFO L85 PathProgramCache]: Analyzing trace with hash 630711638, now seen corresponding path program 1 times [2022-07-23 15:51:41,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:51:41,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486215618] [2022-07-23 15:51:41,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:51:41,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:51:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:51:41,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:51:41,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:51:41,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486215618] [2022-07-23 15:51:41,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486215618] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:51:41,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:51:41,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 15:51:41,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036031723] [2022-07-23 15:51:41,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:51:41,095 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 15:51:41,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 15:51:41,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 15:51:41,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 15:51:41,096 INFO L87 Difference]: Start difference. First operand 131 states and 219 transitions. cyclomatic complexity: 89 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:51:41,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 15:51:41,166 INFO L93 Difference]: Finished difference Result 211 states and 344 transitions. [2022-07-23 15:51:41,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 15:51:41,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 211 states and 344 transitions. [2022-07-23 15:51:41,169 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2022-07-23 15:51:41,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 211 states to 208 states and 318 transitions. [2022-07-23 15:51:41,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 208 [2022-07-23 15:51:41,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 208 [2022-07-23 15:51:41,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 208 states and 318 transitions. [2022-07-23 15:51:41,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 15:51:41,179 INFO L369 hiAutomatonCegarLoop]: Abstraction has 208 states and 318 transitions. [2022-07-23 15:51:41,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states and 318 transitions. [2022-07-23 15:51:41,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 131. [2022-07-23 15:51:41,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 131 states have (on average 1.4885496183206106) internal successors, (195), 130 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:51:41,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 195 transitions. [2022-07-23 15:51:41,190 INFO L392 hiAutomatonCegarLoop]: Abstraction has 131 states and 195 transitions. [2022-07-23 15:51:41,190 INFO L374 stractBuchiCegarLoop]: Abstraction has 131 states and 195 transitions. [2022-07-23 15:51:41,190 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-23 15:51:41,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 195 transitions. [2022-07-23 15:51:41,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2022-07-23 15:51:41,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:51:41,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:51:41,197 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:51:41,197 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:51:41,198 INFO L752 eck$LassoCheckResult]: Stem: 779#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(43, 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;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; 715#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~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#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;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#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; 679#L255 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 662#L258-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 663#L268 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 687#L271-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 668#L281 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 669#L284-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 722#L294 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 702#L297-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 706#L307 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 724#L310-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 754#L320 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 653#L323-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 743#L333 assume ~id1~0 != ~id2~0; 709#L334 assume ~id1~0 != ~id3~0; 692#L335 assume ~id2~0 != ~id3~0; 693#L336 assume ~id1~0 >= 0; 753#L337 assume ~id2~0 >= 0; 725#L338 assume ~id3~0 >= 0; 726#L339 assume 0 == ~r1~0; 773#L340 assume 0 == ~r2~0; 762#L341 assume 0 == ~r3~0; 710#L342 assume ~max1~0 == ~id1~0; 711#L343 assume ~max2~0 == ~id2~0; 703#L344 assume ~max3~0 == ~id3~0; 704#L345 assume 0 == ~st1~0; 719#L346 assume 0 == ~st2~0; 720#L347 assume 0 == ~st3~0; 777#L348 assume 0 == ~nl1~0; 757#L349 assume 0 == ~nl2~0; 758#L350 assume 0 == ~nl3~0; 746#L351 assume 0 == ~mode1~0 % 256; 747#L352 assume 0 == ~mode2~0 % 256; 769#L353 assume 0 == ~mode3~0 % 256; 738#L354 assume 0 != ~newmax1~0 % 256; 712#L355 assume 0 != ~newmax2~0 % 256; 713#L356 assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; 760#L333-1 init_#res#1 := init_~tmp___5~0#1; 675#L430 main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1; 676#L527 assume !(0 == main_~i2~0#1); 767#L527-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; 677#L541-2 [2022-07-23 15:51:41,198 INFO L754 eck$LassoCheckResult]: Loop: 677#L541-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 678#L79 assume !(0 != ~mode1~0 % 256); 731#L107 assume !(~r1~0 < 2); 728#L107-1 ~mode1~0 := 1; 674#L79-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 714#L130 assume !(0 != ~mode2~0 % 256); 671#L158 assume !(~r2~0 < 2); 666#L158-1 ~mode2~0 := 1; 734#L130-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 735#L181 assume !(0 != ~mode3~0 % 256); 768#L209 assume !(~r3~0 < 2); 699#L209-1 ~mode3~0 := 1; 682#L181-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; 721#L438 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 736#L439 assume ~st1~0 + ~nl1~0 <= 1; 737#L440 assume ~st2~0 + ~nl2~0 <= 1; 685#L441 assume ~st3~0 + ~nl3~0 <= 1; 686#L442 assume ~r1~0 >= 2; 694#L446 assume ~r1~0 < 2; 766#L451 assume ~r1~0 >= 2; 650#L456 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 717#L438-1 check_#res#1 := check_~tmp~1#1; 718#L486 main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; 770#L571 assume !(0 == assert_~arg#1 % 256); 776#L566 assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; 677#L541-2 [2022-07-23 15:51:41,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:51:41,199 INFO L85 PathProgramCache]: Analyzing trace with hash -2116426971, now seen corresponding path program 1 times [2022-07-23 15:51:41,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:51:41,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670348366] [2022-07-23 15:51:41,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:51:41,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:51:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:51:41,241 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:51:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:51:41,311 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:51:41,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:51:41,312 INFO L85 PathProgramCache]: Analyzing trace with hash 630711638, now seen corresponding path program 2 times [2022-07-23 15:51:41,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:51:41,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204966416] [2022-07-23 15:51:41,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:51:41,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:51:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:51:41,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:51:41,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:51:41,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204966416] [2022-07-23 15:51:41,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204966416] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:51:41,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:51:41,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 15:51:41,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91696764] [2022-07-23 15:51:41,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:51:41,348 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 15:51:41,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 15:51:41,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 15:51:41,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 15:51:41,349 INFO L87 Difference]: Start difference. First operand 131 states and 195 transitions. cyclomatic complexity: 65 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:51:41,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 15:51:41,380 INFO L93 Difference]: Finished difference Result 189 states and 282 transitions. [2022-07-23 15:51:41,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 15:51:41,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 189 states and 282 transitions. [2022-07-23 15:51:41,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 135 [2022-07-23 15:51:41,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 189 states to 189 states and 282 transitions. [2022-07-23 15:51:41,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 189 [2022-07-23 15:51:41,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 189 [2022-07-23 15:51:41,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 189 states and 282 transitions. [2022-07-23 15:51:41,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 15:51:41,392 INFO L369 hiAutomatonCegarLoop]: Abstraction has 189 states and 282 transitions. [2022-07-23 15:51:41,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states and 282 transitions. [2022-07-23 15:51:41,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-07-23 15:51:41,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 189 states have (on average 1.492063492063492) internal successors, (282), 188 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:51:41,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 282 transitions. [2022-07-23 15:51:41,413 INFO L392 hiAutomatonCegarLoop]: Abstraction has 189 states and 282 transitions. [2022-07-23 15:51:41,413 INFO L374 stractBuchiCegarLoop]: Abstraction has 189 states and 282 transitions. [2022-07-23 15:51:41,413 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-23 15:51:41,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 189 states and 282 transitions. [2022-07-23 15:51:41,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 135 [2022-07-23 15:51:41,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:51:41,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:51:41,420 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:51:41,420 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:51:41,420 INFO L752 eck$LassoCheckResult]: Stem: 1111#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(43, 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;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; 1042#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~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#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;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#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; 1005#L255 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 988#L258-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 989#L268 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 1009#L271-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 994#L281 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 995#L284-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 1049#L294 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 1027#L297-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 1031#L307 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 1051#L310-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 1082#L320 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 977#L323-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 1070#L333 assume ~id1~0 != ~id2~0; 1034#L334 assume ~id1~0 != ~id3~0; 1018#L335 assume ~id2~0 != ~id3~0; 1019#L336 assume ~id1~0 >= 0; 1081#L337 assume ~id2~0 >= 0; 1052#L338 assume ~id3~0 >= 0; 1053#L339 assume 0 == ~r1~0; 1102#L340 assume 0 == ~r2~0; 1090#L341 assume 0 == ~r3~0; 1035#L342 assume ~max1~0 == ~id1~0; 1036#L343 assume ~max2~0 == ~id2~0; 1028#L344 assume ~max3~0 == ~id3~0; 1029#L345 assume 0 == ~st1~0; 1046#L346 assume 0 == ~st2~0; 1047#L347 assume 0 == ~st3~0; 1108#L348 assume 0 == ~nl1~0; 1085#L349 assume 0 == ~nl2~0; 1086#L350 assume 0 == ~nl3~0; 1073#L351 assume 0 == ~mode1~0 % 256; 1074#L352 assume 0 == ~mode2~0 % 256; 1097#L353 assume 0 == ~mode3~0 % 256; 1065#L354 assume 0 != ~newmax1~0 % 256; 1037#L355 assume 0 != ~newmax2~0 % 256; 1038#L356 assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; 1088#L333-1 init_#res#1 := init_~tmp___5~0#1; 999#L430 main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1; 1000#L527 assume !(0 == main_~i2~0#1); 1093#L527-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; 1109#L541-2 [2022-07-23 15:51:41,420 INFO L754 eck$LassoCheckResult]: Loop: 1109#L541-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 1159#L79 assume !(0 != ~mode1~0 % 256); 1158#L107 assume ~r1~0 < 2; 1015#L108 assume !(0 != ~ep12~0 % 256); 1016#L108-1 assume !(0 != ~ep13~0 % 256); 1055#L107-1 ~mode1~0 := 1; 1152#L79-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 1151#L130 assume !(0 != ~mode2~0 % 256); 1137#L158 assume !(~r2~0 < 2); 1133#L158-1 ~mode2~0 := 1; 1132#L130-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 1127#L181 assume !(0 != ~mode3~0 % 256); 1125#L209 assume !(~r3~0 < 2); 1120#L209-1 ~mode3~0 := 1; 1119#L181-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; 1118#L438 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 1117#L439 assume ~st1~0 + ~nl1~0 <= 1; 1116#L440 assume ~st2~0 + ~nl2~0 <= 1; 1115#L441 assume ~st3~0 + ~nl3~0 <= 1; 1114#L442 assume !(~r1~0 >= 2); 1040#L445 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 1041#L446 assume ~r1~0 < 2; 1113#L451 assume !(~r1~0 >= 2); 978#L455 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 979#L456 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 1163#L438-1 check_#res#1 := check_~tmp~1#1; 1162#L486 main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; 1161#L571 assume !(0 == assert_~arg#1 % 256); 1160#L566 assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; 1109#L541-2 [2022-07-23 15:51:41,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:51:41,422 INFO L85 PathProgramCache]: Analyzing trace with hash -2116426971, now seen corresponding path program 2 times [2022-07-23 15:51:41,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:51:41,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554249164] [2022-07-23 15:51:41,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:51:41,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:51:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:51:41,456 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:51:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:51:41,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:51:41,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:51:41,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1466264639, now seen corresponding path program 1 times [2022-07-23 15:51:41,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:51:41,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577318385] [2022-07-23 15:51:41,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:51:41,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:51:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:51:41,533 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:51:41,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:51:41,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:51:41,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:51:41,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1977070365, now seen corresponding path program 1 times [2022-07-23 15:51:41,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:51:41,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402382031] [2022-07-23 15:51:41,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:51:41,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:51:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:51:41,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:51:41,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:51:41,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402382031] [2022-07-23 15:51:41,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402382031] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:51:41,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:51:41,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 15:51:41,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775005992] [2022-07-23 15:51:41,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:51:42,270 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 15:51:42,271 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 15:51:42,272 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 15:51:42,272 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 15:51:42,272 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-23 15:51:42,272 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:51:42,272 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 15:51:42,273 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 15:51:42,273 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2022-07-23 15:51:42,273 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 15:51:42,273 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 15:51:42,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:42,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:42,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:42,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:42,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:42,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:42,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:42,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:42,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:42,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:42,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:42,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:42,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:42,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:42,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:42,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:42,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:42,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:42,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:42,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:42,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:42,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:42,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:42,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:42,799 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 15:51:42,800 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-23 15:51:42,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:51:42,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:51:42,805 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:51:42,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-23 15:51:42,806 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-23 15:51:42,807 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 15:51:42,824 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-23 15:51:42,824 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~ep12~0=0} Honda state: {~ep12~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-23 15:51:42,840 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 [2022-07-23 15:51:42,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:51:42,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:51:42,841 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:51:42,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-23 15:51:42,844 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-23 15:51:42,844 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 15:51:42,851 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-23 15:51:42,851 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_node2_~newmax~1#1=0} Honda state: {ULTIMATE.start_node2_~newmax~1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-23 15:51:42,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-07-23 15:51:42,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:51:42,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:51:42,868 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:51:42,878 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-23 15:51:42,879 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 15:51:42,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-23 15:51:42,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-23 15:51:42,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:51:42,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:51:42,966 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:51:43,022 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-23 15:51:43,023 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 15:51:43,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-23 15:51:43,144 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-23 15:51:43,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-23 15:51:43,148 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 15:51:43,148 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 15:51:43,148 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 15:51:43,148 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 15:51:43,148 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 15:51:43,148 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:51:43,148 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 15:51:43,148 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 15:51:43,148 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2022-07-23 15:51:43,148 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 15:51:43,148 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 15:51:43,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:43,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:43,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:43,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:43,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:43,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:43,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:43,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:43,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:43,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:43,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:43,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:43,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:43,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:43,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:43,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:43,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:43,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:43,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:43,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:43,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:43,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:43,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:43,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:51:43,624 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 15:51:43,628 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 15:51:43,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:51:43,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:51:43,632 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:51:43,642 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 15:51:43,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:51:43,650 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:51:43,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:51:43,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:51:43,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:51:43,654 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:51:43,655 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:51:43,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-23 15:51:43,672 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:51:43,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-23 15:51:43,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:51:43,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:51:43,702 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:51:43,711 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 15:51:43,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:51:43,717 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:51:43,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:51:43,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:51:43,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:51:43,718 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:51:43,719 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:51:43,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-23 15:51:43,731 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:51:43,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-23 15:51:43,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:51:43,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:51:43,759 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:51:43,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-23 15:51:43,762 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 15:51:43,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:51:43,768 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:51:43,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:51:43,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:51:43,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:51:43,770 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:51:43,770 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:51:43,787 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:51:43,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-23 15:51:43,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:51:43,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:51:43,814 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:51:43,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 15:51:43,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:51:43,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:51:43,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:51:43,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:51:43,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:51:43,830 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:51:43,830 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:51:43,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-23 15:51:43,843 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:51:43,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-23 15:51:43,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:51:43,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:51:43,870 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:51:43,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-23 15:51:43,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 15:51:43,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:51:43,880 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:51:43,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:51:43,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:51:43,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:51:43,882 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:51:43,882 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:51:43,891 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:51:43,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-23 15:51:43,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:51:43,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:51:43,919 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:51:43,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 15:51:43,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:51:43,931 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:51:43,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:51:43,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:51:43,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:51:43,932 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:51:43,932 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:51:43,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-23 15:51:43,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:51:43,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-23 15:51:43,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:51:43,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:51:43,975 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:51:43,982 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 15:51:43,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:51:43,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:51:43,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:51:43,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:51:43,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:51:43,990 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:51:43,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:51:43,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-23 15:51:44,001 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 15:51:44,018 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-23 15:51:44,018 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-23 15:51:44,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:51:44,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:51:44,021 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:51:44,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-23 15:51:44,025 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 15:51:44,026 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-23 15:51:44,026 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 15:51:44,027 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 11 Supporting invariants [] [2022-07-23 15:51:44,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-23 15:51:44,053 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-23 15:51:44,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:51:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:51:44,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 15:51:44,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 15:51:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:51:44,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 15:51:44,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 15:51:44,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:51:44,370 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-23 15:51:44,371 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 189 states and 282 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:51:44,433 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 189 states and 282 transitions. cyclomatic complexity: 94. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 323 states and 492 transitions. Complement of second has 4 states. [2022-07-23 15:51:44,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-23 15:51:44,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:51:44,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 195 transitions. [2022-07-23 15:51:44,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 195 transitions. Stem has 42 letters. Loop has 29 letters. [2022-07-23 15:51:44,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 15:51:44,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 195 transitions. Stem has 71 letters. Loop has 29 letters. [2022-07-23 15:51:44,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 15:51:44,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 195 transitions. Stem has 42 letters. Loop has 58 letters. [2022-07-23 15:51:44,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 15:51:44,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 323 states and 492 transitions. [2022-07-23 15:51:44,450 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-23 15:51:44,451 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 323 states to 0 states and 0 transitions. [2022-07-23 15:51:44,451 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-23 15:51:44,451 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-23 15:51:44,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-23 15:51:44,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 15:51:44,451 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 15:51:44,451 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 15:51:44,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 15:51:44,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 15:51:44,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 15:51:44,455 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:51:44,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 15:51:44,457 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-07-23 15:51:44,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-23 15:51:44,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-07-23 15:51:44,460 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-23 15:51:44,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-07-23 15:51:44,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-23 15:51:44,460 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-23 15:51:44,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-23 15:51:44,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 15:51:44,461 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 15:51:44,461 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 15:51:44,461 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 15:51:44,461 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-23 15:51:44,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-23 15:51:44,461 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-23 15:51:44,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-23 15:51:44,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.07 03:51:44 BoogieIcfgContainer [2022-07-23 15:51:44,493 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-23 15:51:44,494 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-23 15:51:44,494 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-23 15:51:44,494 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-23 15:51:44,494 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:51:40" (3/4) ... [2022-07-23 15:51:44,497 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-23 15:51:44,497 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-23 15:51:44,498 INFO L158 Benchmark]: Toolchain (without parser) took 5333.99ms. Allocated memory was 86.0MB in the beginning and 127.9MB in the end (delta: 41.9MB). Free memory was 63.8MB in the beginning and 95.8MB in the end (delta: -32.0MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2022-07-23 15:51:44,499 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 86.0MB. Free memory was 62.0MB in the beginning and 61.9MB in the end (delta: 86.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 15:51:44,501 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.47ms. Allocated memory is still 86.0MB. Free memory was 63.5MB in the beginning and 56.8MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-23 15:51:44,506 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.83ms. Allocated memory is still 86.0MB. Free memory was 56.8MB in the beginning and 53.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 15:51:44,509 INFO L158 Benchmark]: Boogie Preprocessor took 35.02ms. Allocated memory is still 86.0MB. Free memory was 53.9MB in the beginning and 51.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 15:51:44,509 INFO L158 Benchmark]: RCFGBuilder took 611.68ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 51.5MB in the beginning and 76.3MB in the end (delta: -24.8MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. [2022-07-23 15:51:44,510 INFO L158 Benchmark]: BuchiAutomizer took 4238.97ms. Allocated memory was 104.9MB in the beginning and 127.9MB in the end (delta: 23.1MB). Free memory was 76.3MB in the beginning and 96.1MB in the end (delta: -19.7MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. [2022-07-23 15:51:44,510 INFO L158 Benchmark]: Witness Printer took 3.73ms. Allocated memory is still 127.9MB. Free memory was 96.1MB in the beginning and 95.8MB in the end (delta: 235.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 15:51:44,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-07-23 15:51:44,518 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.21ms. Allocated memory is still 86.0MB. Free memory was 62.0MB in the beginning and 61.9MB in the end (delta: 86.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 382.47ms. Allocated memory is still 86.0MB. Free memory was 63.5MB in the beginning and 56.8MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.83ms. Allocated memory is still 86.0MB. Free memory was 56.8MB in the beginning and 53.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.02ms. Allocated memory is still 86.0MB. Free memory was 53.9MB in the beginning and 51.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 611.68ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 51.5MB in the beginning and 76.3MB in the end (delta: -24.8MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 4238.97ms. Allocated memory was 104.9MB in the beginning and 127.9MB in the end (delta: 23.1MB). Free memory was 76.3MB in the beginning and 96.1MB in the end (delta: -19.7MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. * Witness Printer took 3.73ms. Allocated memory is still 127.9MB. Free memory was 96.1MB in the beginning and 95.8MB in the end (delta: 235.2kB). 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 4.1s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 3.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 77 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 398 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 397 mSDsluCounter, 2420 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1589 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 54 IncrementalHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 831 mSDtfsCounter, 54 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital142 mio100 ax100 hnf100 lsp26 ukn100 mio100 lsp100 div123 bol100 ite100 ukn100 eq182 hnf86 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 43ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-23 15:51:44,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE