./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.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 c5be25d34b5f565c0e61b447a9da3cd9d228084b5ddd898e062981f46972caa8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 04:33:50,034 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 04:33:50,036 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 04:33:50,060 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 04:33:50,067 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 04:33:50,068 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 04:33:50,069 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 04:33:50,070 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 04:33:50,071 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 04:33:50,072 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 04:33:50,073 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 04:33:50,073 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 04:33:50,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 04:33:50,075 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 04:33:50,076 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 04:33:50,076 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 04:33:50,079 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 04:33:50,080 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 04:33:50,084 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 04:33:50,085 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 04:33:50,093 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 04:33:50,094 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 04:33:50,094 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 04:33:50,095 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 04:33:50,096 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 04:33:50,098 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 04:33:50,104 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 04:33:50,104 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 04:33:50,105 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 04:33:50,105 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 04:33:50,106 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 04:33:50,106 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 04:33:50,107 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 04:33:50,107 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 04:33:50,110 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 04:33:50,110 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 04:33:50,112 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 04:33:50,112 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 04:33:50,112 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 04:33:50,113 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 04:33:50,114 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 04:33:50,115 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 04:33:50,117 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-13 04:33:50,142 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 04:33:50,143 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 04:33:50,143 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 04:33:50,143 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 04:33:50,144 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 04:33:50,144 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 04:33:50,145 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 04:33:50,145 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 04:33:50,145 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 04:33:50,146 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 04:33:50,146 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 04:33:50,146 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 04:33:50,146 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 04:33:50,146 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 04:33:50,147 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 04:33:50,147 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 04:33:50,147 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 04:33:50,147 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 04:33:50,147 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 04:33:50,148 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 04:33:50,148 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 04:33:50,148 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 04:33:50,148 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 04:33:50,148 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 04:33:50,148 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 04:33:50,149 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 04:33:50,149 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 04:33:50,149 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 04:33:50,149 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 04:33:50,149 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 04:33:50,150 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 04:33:50,150 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 04:33:50,150 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 -> c5be25d34b5f565c0e61b447a9da3cd9d228084b5ddd898e062981f46972caa8 [2022-07-13 04:33:50,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 04:33:50,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 04:33:50,392 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 04:33:50,393 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 04:33:50,394 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 04:33:50,395 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c [2022-07-13 04:33:50,444 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd9aa1113/83dadfc9546a476ebb25e7381f95e4db/FLAG1063a3017 [2022-07-13 04:33:50,813 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 04:33:50,813 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c [2022-07-13 04:33:50,821 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd9aa1113/83dadfc9546a476ebb25e7381f95e4db/FLAG1063a3017 [2022-07-13 04:33:50,836 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd9aa1113/83dadfc9546a476ebb25e7381f95e4db [2022-07-13 04:33:50,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 04:33:50,840 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 04:33:50,842 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 04:33:50,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 04:33:50,845 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 04:33:50,846 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:33:50" (1/1) ... [2022-07-13 04:33:50,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3db32666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:33:50, skipping insertion in model container [2022-07-13 04:33:50,848 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:33:50" (1/1) ... [2022-07-13 04:33:50,853 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 04:33:50,879 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 04:33:51,068 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_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c[9280,9293] [2022-07-13 04:33:51,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:33:51,076 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 04:33:51,110 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_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c[9280,9293] [2022-07-13 04:33:51,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:33:51,123 INFO L208 MainTranslator]: Completed translation [2022-07-13 04:33:51,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:33:51 WrapperNode [2022-07-13 04:33:51,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 04:33:51,125 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 04:33:51,125 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 04:33:51,125 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 04:33:51,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:33:51" (1/1) ... [2022-07-13 04:33:51,139 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:33:51" (1/1) ... [2022-07-13 04:33:51,162 INFO L137 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 298 [2022-07-13 04:33:51,162 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 04:33:51,163 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 04:33:51,163 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 04:33:51,163 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 04:33:51,170 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:33:51" (1/1) ... [2022-07-13 04:33:51,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:33:51" (1/1) ... [2022-07-13 04:33:51,174 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:33:51" (1/1) ... [2022-07-13 04:33:51,174 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:33:51" (1/1) ... [2022-07-13 04:33:51,179 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:33:51" (1/1) ... [2022-07-13 04:33:51,183 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:33:51" (1/1) ... [2022-07-13 04:33:51,185 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:33:51" (1/1) ... [2022-07-13 04:33:51,188 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 04:33:51,189 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 04:33:51,189 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 04:33:51,189 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 04:33:51,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:33:51" (1/1) ... [2022-07-13 04:33:51,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:33:51,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:33:51,240 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-13 04:33:51,262 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-13 04:33:51,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 04:33:51,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 04:33:51,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 04:33:51,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 04:33:51,396 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 04:33:51,397 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 04:33:51,687 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 04:33:51,694 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 04:33:51,694 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 04:33:51,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:33:51 BoogieIcfgContainer [2022-07-13 04:33:51,696 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 04:33:51,697 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 04:33:51,697 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 04:33:51,700 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 04:33:51,701 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:33:51,701 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 04:33:50" (1/3) ... [2022-07-13 04:33:51,702 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a062a19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:33:51, skipping insertion in model container [2022-07-13 04:33:51,702 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:33:51,702 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:33:51" (2/3) ... [2022-07-13 04:33:51,702 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a062a19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:33:51, skipping insertion in model container [2022-07-13 04:33:51,703 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:33:51,703 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:33:51" (3/3) ... [2022-07-13 04:33:51,704 INFO L354 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c [2022-07-13 04:33:51,756 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 04:33:51,757 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 04:33:51,757 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 04:33:51,757 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 04:33:51,757 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 04:33:51,757 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 04:33:51,757 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 04:33:51,758 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 04:33:51,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 96 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 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-13 04:33:51,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2022-07-13 04:33:51,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:33:51,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:33:51,788 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:33:51,788 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] [2022-07-13 04:33:51,789 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 04:33:51,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 96 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 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-13 04:33:51,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2022-07-13 04:33:51,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:33:51,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:33:51,802 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:33:51,802 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] [2022-07-13 04:33:51,810 INFO L752 eck$LassoCheckResult]: Stem: 70#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0; 56#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~ret32#1, main_#t~ret33#1, main_#t~post34#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~alive1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 3#L198true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 32#L198-1true init_#res#1 := init_~tmp~0#1; 6#L295true main_#t~ret32#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1; 65#L347true assume !(0 == main_~i2~0#1); 92#L347-2true ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 55#L357-2true [2022-07-13 04:33:51,811 INFO L754 eck$LassoCheckResult]: Loop: 55#L357-2true assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 95#L65true assume !(0 != ~mode1~0 % 256); 30#L83true assume !(0 != ~alive1~0 % 256); 62#L83-2true ~mode1~0 := 1; 53#L65-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 12#L97true assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 77#L100true assume !(node2_~m2~0#1 != ~nomsg~0); 10#L100-1true ~mode2~0 := 0; 74#L97-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 60#L131true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 73#L134true assume !(node3_~m3~0#1 != ~nomsg~0); 66#L134-1true ~mode3~0 := 0; 37#L131-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 18#L165true assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 5#L168true assume !(node4_~m4~0#1 != ~nomsg~0); 82#L168-1true ~mode4~0 := 0; 29#L165-2true assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 75#L303true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 43#L303-1true check_#res#1 := check_~tmp~1#1; 61#L315true main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#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; 93#L384true assume !(0 == assert_~arg#1 % 256); 49#L379true assume { :end_inline_assert } true;main_#t~post34#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post34#1;havoc main_#t~post34#1; 55#L357-2true [2022-07-13 04:33:51,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:33:51,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1938506578, now seen corresponding path program 1 times [2022-07-13 04:33:51,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:33:51,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068462057] [2022-07-13 04:33:51,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:33:51,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:33:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:33:52,032 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-13 04:33:52,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:33:52,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068462057] [2022-07-13 04:33:52,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068462057] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:33:52,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:33:52,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 04:33:52,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577721821] [2022-07-13 04:33:52,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:33:52,039 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:33:52,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:33:52,040 INFO L85 PathProgramCache]: Analyzing trace with hash -2060736893, now seen corresponding path program 1 times [2022-07-13 04:33:52,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:33:52,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730721411] [2022-07-13 04:33:52,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:33:52,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:33:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:33:52,167 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-13 04:33:52,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:33:52,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730721411] [2022-07-13 04:33:52,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730721411] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:33:52,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:33:52,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 04:33:52,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627501583] [2022-07-13 04:33:52,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:33:52,171 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 04:33:52,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:33:52,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 04:33:52,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 04:33:52,211 INFO L87 Difference]: Start difference. First operand has 96 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:33:52,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:33:52,314 INFO L93 Difference]: Finished difference Result 161 states and 258 transitions. [2022-07-13 04:33:52,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 04:33:52,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 258 transitions. [2022-07-13 04:33:52,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2022-07-13 04:33:52,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 152 states and 226 transitions. [2022-07-13 04:33:52,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 152 [2022-07-13 04:33:52,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 152 [2022-07-13 04:33:52,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 152 states and 226 transitions. [2022-07-13 04:33:52,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:33:52,334 INFO L369 hiAutomatonCegarLoop]: Abstraction has 152 states and 226 transitions. [2022-07-13 04:33:52,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states and 226 transitions. [2022-07-13 04:33:52,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 91. [2022-07-13 04:33:52,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 90 states have internal predecessors, (128), 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-13 04:33:52,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2022-07-13 04:33:52,394 INFO L392 hiAutomatonCegarLoop]: Abstraction has 91 states and 128 transitions. [2022-07-13 04:33:52,394 INFO L374 stractBuchiCegarLoop]: Abstraction has 91 states and 128 transitions. [2022-07-13 04:33:52,394 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 04:33:52,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 128 transitions. [2022-07-13 04:33:52,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2022-07-13 04:33:52,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:33:52,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:33:52,410 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] [2022-07-13 04:33:52,410 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] [2022-07-13 04:33:52,411 INFO L752 eck$LassoCheckResult]: Stem: 357#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0; 350#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~ret32#1, main_#t~ret33#1, main_#t~post34#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~alive1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 275#L198 assume 0 == ~r1~0; 276#L199 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; 343#L200 assume ~id1~0 >= 0; 344#L201 assume 0 == ~st1~0; 319#L202 assume ~send1~0 == ~id1~0; 320#L203 assume 0 == ~mode1~0 % 256; 333#L204 assume ~id2~0 >= 0; 299#L205 assume 0 == ~st2~0; 300#L206 assume ~send2~0 == ~id2~0; 284#L207 assume 0 == ~mode2~0 % 256; 285#L208 assume ~id3~0 >= 0; 347#L209 assume 0 == ~st3~0; 301#L210 assume ~send3~0 == ~id3~0; 302#L211 assume 0 == ~mode3~0 % 256; 289#L212 assume ~id4~0 >= 0; 290#L213 assume 0 == ~st4~0; 361#L214 assume ~send4~0 == ~id4~0; 362#L215 assume 0 == ~mode4~0 % 256; 345#L216 assume ~id1~0 != ~id2~0; 321#L217 assume ~id1~0 != ~id3~0; 322#L218 assume ~id1~0 != ~id4~0; 351#L219 assume ~id2~0 != ~id3~0; 365#L220 assume ~id2~0 != ~id4~0; 315#L221 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 316#L198-1 init_#res#1 := init_~tmp~0#1; 282#L295 main_#t~ret32#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1; 283#L347 assume !(0 == main_~i2~0#1); 356#L347-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 342#L357-2 [2022-07-13 04:33:52,411 INFO L754 eck$LassoCheckResult]: Loop: 342#L357-2 assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 349#L65 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 307#L69 assume !(node1_~m1~0#1 != ~nomsg~0); 278#L69-1 ~mode1~0 := 0; 348#L65-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 294#L97 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 296#L100 assume !(node2_~m2~0#1 != ~nomsg~0); 292#L100-1 ~mode2~0 := 0; 293#L97-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 352#L131 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 353#L134 assume !(node3_~m3~0#1 != ~nomsg~0); 313#L134-1 ~mode3~0 := 0; 328#L131-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 305#L165 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 279#L168 assume !(node4_~m4~0#1 != ~nomsg~0); 280#L168-1 ~mode4~0 := 0; 323#L165-2 assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 324#L303 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 304#L303-1 check_#res#1 := check_~tmp~1#1; 339#L315 main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#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; 354#L384 assume !(0 == assert_~arg#1 % 256); 341#L379 assume { :end_inline_assert } true;main_#t~post34#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post34#1;havoc main_#t~post34#1; 342#L357-2 [2022-07-13 04:33:52,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:33:52,412 INFO L85 PathProgramCache]: Analyzing trace with hash -805895157, now seen corresponding path program 1 times [2022-07-13 04:33:52,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:33:52,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434208864] [2022-07-13 04:33:52,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:33:52,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:33:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:33:52,472 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:33:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:33:52,542 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:33:52,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:33:52,544 INFO L85 PathProgramCache]: Analyzing trace with hash -388024983, now seen corresponding path program 1 times [2022-07-13 04:33:52,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:33:52,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412633048] [2022-07-13 04:33:52,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:33:52,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:33:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:33:52,630 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-13 04:33:52,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:33:52,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412633048] [2022-07-13 04:33:52,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412633048] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:33:52,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:33:52,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 04:33:52,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136559808] [2022-07-13 04:33:52,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:33:52,635 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 04:33:52,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:33:52,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 04:33:52,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 04:33:52,636 INFO L87 Difference]: Start difference. First operand 91 states and 128 transitions. cyclomatic complexity: 38 Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-13 04:33:52,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:33:52,705 INFO L93 Difference]: Finished difference Result 94 states and 130 transitions. [2022-07-13 04:33:52,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 04:33:52,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 130 transitions. [2022-07-13 04:33:52,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2022-07-13 04:33:52,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 91 states and 126 transitions. [2022-07-13 04:33:52,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 [2022-07-13 04:33:52,720 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2022-07-13 04:33:52,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 126 transitions. [2022-07-13 04:33:52,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:33:52,721 INFO L369 hiAutomatonCegarLoop]: Abstraction has 91 states and 126 transitions. [2022-07-13 04:33:52,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 126 transitions. [2022-07-13 04:33:52,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-07-13 04:33:52,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 90 states have internal predecessors, (126), 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-13 04:33:52,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 126 transitions. [2022-07-13 04:33:52,729 INFO L392 hiAutomatonCegarLoop]: Abstraction has 91 states and 126 transitions. [2022-07-13 04:33:52,729 INFO L374 stractBuchiCegarLoop]: Abstraction has 91 states and 126 transitions. [2022-07-13 04:33:52,729 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 04:33:52,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 126 transitions. [2022-07-13 04:33:52,731 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2022-07-13 04:33:52,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:33:52,731 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:33:52,732 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] [2022-07-13 04:33:52,732 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] [2022-07-13 04:33:52,732 INFO L752 eck$LassoCheckResult]: Stem: 554#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0; 547#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~ret32#1, main_#t~ret33#1, main_#t~post34#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~alive1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 477#L198 assume 0 == ~r1~0; 478#L199 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; 540#L200 assume ~id1~0 >= 0; 541#L201 assume 0 == ~st1~0; 516#L202 assume ~send1~0 == ~id1~0; 517#L203 assume 0 == ~mode1~0 % 256; 530#L204 assume ~id2~0 >= 0; 496#L205 assume 0 == ~st2~0; 497#L206 assume ~send2~0 == ~id2~0; 481#L207 assume 0 == ~mode2~0 % 256; 482#L208 assume ~id3~0 >= 0; 544#L209 assume 0 == ~st3~0; 498#L210 assume ~send3~0 == ~id3~0; 499#L211 assume 0 == ~mode3~0 % 256; 486#L212 assume ~id4~0 >= 0; 487#L213 assume 0 == ~st4~0; 558#L214 assume ~send4~0 == ~id4~0; 559#L215 assume 0 == ~mode4~0 % 256; 542#L216 assume ~id1~0 != ~id2~0; 518#L217 assume ~id1~0 != ~id3~0; 519#L218 assume ~id1~0 != ~id4~0; 548#L219 assume ~id2~0 != ~id3~0; 562#L220 assume ~id2~0 != ~id4~0; 512#L221 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 513#L198-1 init_#res#1 := init_~tmp~0#1; 479#L295 main_#t~ret32#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1; 480#L347 assume !(0 == main_~i2~0#1); 553#L347-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 539#L357-2 [2022-07-13 04:33:52,733 INFO L754 eck$LassoCheckResult]: Loop: 539#L357-2 assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 546#L65 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 504#L69 assume !(node1_~m1~0#1 != ~nomsg~0); 473#L69-1 ~mode1~0 := 0; 545#L65-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 491#L97 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 493#L100 assume !(node2_~m2~0#1 != ~nomsg~0); 489#L100-1 ~mode2~0 := 0; 490#L97-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 549#L131 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 550#L134 assume !(node3_~m3~0#1 != ~nomsg~0); 510#L134-1 ~mode3~0 := 0; 525#L131-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 502#L165 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 474#L168 assume !(node4_~m4~0#1 != ~nomsg~0); 475#L168-1 ~mode4~0 := 0; 520#L165-2 assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 521#L303 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 536#L304 assume ~r1~0 < 4;check_~tmp~1#1 := 1; 501#L303-1 check_#res#1 := check_~tmp~1#1; 537#L315 main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#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; 551#L384 assume !(0 == assert_~arg#1 % 256); 538#L379 assume { :end_inline_assert } true;main_#t~post34#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post34#1;havoc main_#t~post34#1; 539#L357-2 [2022-07-13 04:33:52,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:33:52,734 INFO L85 PathProgramCache]: Analyzing trace with hash -805895157, now seen corresponding path program 2 times [2022-07-13 04:33:52,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:33:52,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268294696] [2022-07-13 04:33:52,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:33:52,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:33:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:33:52,754 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:33:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:33:52,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:33:52,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:33:52,779 INFO L85 PathProgramCache]: Analyzing trace with hash 472800243, now seen corresponding path program 1 times [2022-07-13 04:33:52,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:33:52,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137628774] [2022-07-13 04:33:52,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:33:52,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:33:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:33:52,793 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:33:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:33:52,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:33:52,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:33:52,809 INFO L85 PathProgramCache]: Analyzing trace with hash 614624425, now seen corresponding path program 1 times [2022-07-13 04:33:52,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:33:52,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986881247] [2022-07-13 04:33:52,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:33:52,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:33:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:33:52,862 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-13 04:33:52,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:33:52,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986881247] [2022-07-13 04:33:52,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986881247] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:33:52,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:33:52,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 04:33:52,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022515139] [2022-07-13 04:33:52,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:33:53,582 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:33:53,582 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:33:53,582 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:33:53,582 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:33:53,582 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-13 04:33:53,582 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:33:53,583 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:33:53,583 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:33:53,583 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2022-07-13 04:33:53,583 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:33:53,583 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:33:53,601 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-13 04:33:53,609 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-13 04:33:53,613 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-13 04:33:53,615 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-13 04:33:53,617 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-13 04:33:53,643 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-13 04:33:53,645 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-13 04:33:53,650 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-13 04:33:53,653 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-13 04:33:53,655 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-13 04:33:53,658 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-13 04:33:53,663 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-13 04:33:53,671 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-13 04:33:53,674 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-13 04:33:53,687 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-13 04:33:53,689 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-13 04:33:53,695 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-13 04:33:53,698 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-13 04:33:53,703 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-13 04:33:54,171 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:33:54,171 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-13 04:33:54,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:33:54,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:33:54,177 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-13 04:33:54,186 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:33:54,187 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:33:54,205 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-13 04:33:54,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-13 04:33:54,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:33:54,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:33:54,239 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-13 04:33:54,241 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-13 04:33:54,241 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:33:54,243 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-13 04:33:54,414 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-13 04:33:54,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-13 04:33:54,419 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:33:54,419 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:33:54,419 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:33:54,419 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:33:54,419 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:33:54,419 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:33:54,419 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:33:54,419 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:33:54,420 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2022-07-13 04:33:54,420 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:33:54,420 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:33:54,422 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-13 04:33:54,429 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-13 04:33:54,433 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-13 04:33:54,441 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-13 04:33:54,443 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-13 04:33:54,447 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-13 04:33:54,451 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-13 04:33:54,453 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-13 04:33:54,455 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-13 04:33:54,460 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-13 04:33:54,463 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-13 04:33:54,477 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-13 04:33:54,479 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-13 04:33:54,485 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-13 04:33:54,487 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-13 04:33:54,493 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-13 04:33:54,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:54,527 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-13 04:33:54,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:33:55,024 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:33:55,028 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:33:55,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:33:55,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:33:55,031 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-13 04:33:55,046 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-13 04:33:55,046 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-13 04:33:55,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:33:55,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:33:55,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:33:55,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:33:55,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:33:55,056 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:33:55,056 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:33:55,083 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:33:55,101 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-13 04:33:55,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:33:55,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:33:55,103 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-13 04:33:55,103 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-13 04:33:55,105 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-13 04:33:55,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:33:55,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:33:55,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:33:55,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:33:55,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:33:55,112 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:33:55,112 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:33:55,114 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:33:55,131 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-13 04:33:55,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:33:55,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:33:55,133 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-13 04:33:55,134 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-13 04:33:55,135 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-13 04:33:55,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:33:55,142 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:33:55,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:33:55,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:33:55,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:33:55,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:33:55,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:33:55,143 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:33:55,160 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-13 04:33:55,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:33:55,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:33:55,162 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-13 04:33:55,163 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-13 04:33:55,164 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-13 04:33:55,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:33:55,172 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:33:55,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:33:55,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:33:55,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:33:55,173 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:33:55,173 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:33:55,187 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:33:55,203 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-13 04:33:55,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:33:55,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:33:55,205 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-13 04:33:55,208 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-13 04:33:55,209 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-13 04:33:55,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:33:55,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:33:55,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:33:55,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:33:55,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:33:55,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:33:55,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:33:55,217 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:33:55,241 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-13 04:33:55,241 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-13 04:33:55,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:33:55,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:33:55,244 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-13 04:33:55,245 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-13 04:33:55,292 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:33:55,292 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-13 04:33:55,292 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:33:55,292 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 15 Supporting invariants [] [2022-07-13 04:33:55,308 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-13 04:33:55,310 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-13 04:33:55,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:33:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:33:55,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 04:33:55,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:33:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:33:55,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 04:33:55,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:33:55,621 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-13 04:33:55,624 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-13 04:33:55,625 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 126 transitions. cyclomatic complexity: 36 Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-13 04:33:55,683 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91 states and 126 transitions. cyclomatic complexity: 36. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 152 states and 223 transitions. Complement of second has 4 states. [2022-07-13 04:33:55,683 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-13 04:33:55,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-13 04:33:55,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2022-07-13 04:33:55,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 126 transitions. Stem has 30 letters. Loop has 23 letters. [2022-07-13 04:33:55,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:33:55,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 126 transitions. Stem has 53 letters. Loop has 23 letters. [2022-07-13 04:33:55,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:33:55,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 126 transitions. Stem has 30 letters. Loop has 46 letters. [2022-07-13 04:33:55,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:33:55,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 152 states and 223 transitions. [2022-07-13 04:33:55,699 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-13 04:33:55,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 152 states to 0 states and 0 transitions. [2022-07-13 04:33:55,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-13 04:33:55,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-13 04:33:55,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-13 04:33:55,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:33:55,699 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 04:33:55,700 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 04:33:55,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:33:55,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 04:33:55,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 04:33:55,701 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-13 04:33:55,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:33:55,701 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-07-13 04:33:55,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 04:33:55,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-07-13 04:33:55,702 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-13 04:33:55,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 04:33:55,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-13 04:33:55,702 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-13 04:33:55,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-13 04:33:55,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:33:55,703 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 04:33:55,703 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 04:33:55,703 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 04:33:55,703 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 04:33:55,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-13 04:33:55,703 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-13 04:33:55,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-13 04:33:55,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.07 04:33:55 BoogieIcfgContainer [2022-07-13 04:33:55,710 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-13 04:33:55,710 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 04:33:55,711 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 04:33:55,713 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 04:33:55,713 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:33:51" (3/4) ... [2022-07-13 04:33:55,715 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 04:33:55,715 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 04:33:55,716 INFO L158 Benchmark]: Toolchain (without parser) took 4876.13ms. Allocated memory was 100.7MB in the beginning and 146.8MB in the end (delta: 46.1MB). Free memory was 58.7MB in the beginning and 72.1MB in the end (delta: -13.4MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. [2022-07-13 04:33:55,717 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 100.7MB. Free memory was 75.3MB in the beginning and 75.2MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 04:33:55,717 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.30ms. Allocated memory is still 100.7MB. Free memory was 58.5MB in the beginning and 71.3MB in the end (delta: -12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 04:33:55,717 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.41ms. Allocated memory is still 100.7MB. Free memory was 71.3MB in the beginning and 68.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 04:33:55,718 INFO L158 Benchmark]: Boogie Preprocessor took 25.25ms. Allocated memory is still 100.7MB. Free memory was 68.8MB in the beginning and 67.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 04:33:55,718 INFO L158 Benchmark]: RCFGBuilder took 506.99ms. Allocated memory is still 100.7MB. Free memory was 67.1MB in the beginning and 48.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-13 04:33:55,719 INFO L158 Benchmark]: BuchiAutomizer took 4013.12ms. Allocated memory was 100.7MB in the beginning and 146.8MB in the end (delta: 46.1MB). Free memory was 47.8MB in the beginning and 72.1MB in the end (delta: -24.2MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2022-07-13 04:33:55,719 INFO L158 Benchmark]: Witness Printer took 5.18ms. Allocated memory is still 146.8MB. Free memory is still 72.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 04:33:55,722 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.19ms. Allocated memory is still 100.7MB. Free memory was 75.3MB in the beginning and 75.2MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.30ms. Allocated memory is still 100.7MB. Free memory was 58.5MB in the beginning and 71.3MB in the end (delta: -12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.41ms. Allocated memory is still 100.7MB. Free memory was 71.3MB in the beginning and 68.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.25ms. Allocated memory is still 100.7MB. Free memory was 68.8MB in the beginning and 67.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 506.99ms. Allocated memory is still 100.7MB. Free memory was 67.1MB in the beginning and 48.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 4013.12ms. Allocated memory was 100.7MB in the beginning and 146.8MB in the end (delta: 46.1MB). Free memory was 47.8MB in the beginning and 72.1MB in the end (delta: -24.2MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * Witness Printer took 5.18ms. Allocated memory is still 146.8MB. Free memory is still 72.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 15 + -2 * i2 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.9s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 61 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, 323 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 322 mSDsluCounter, 1298 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 895 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 403 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital145 mio100 ax100 hnf100 lsp34 ukn100 mio100 lsp100 div129 bol100 ite100 ukn100 eq175 hnf85 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 54ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-13 04:33:55,762 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-13 04:33:55,972 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