./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.6_overflow.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.6_overflow.ufo.UNBOUNDED.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 2e89791a2e8bde62b11f5e3f45edc8f6b1d8831a0e105552a6da22a3ff44c454 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 10:11:29,962 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 10:11:29,963 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 10:11:30,015 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 10:11:30,016 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 10:11:30,017 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 10:11:30,018 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 10:11:30,019 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 10:11:30,020 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 10:11:30,020 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 10:11:30,021 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 10:11:30,022 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 10:11:30,023 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 10:11:30,026 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 10:11:30,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 10:11:30,029 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 10:11:30,029 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 10:11:30,030 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 10:11:30,033 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 10:11:30,036 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 10:11:30,037 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 10:11:30,040 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 10:11:30,040 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 10:11:30,041 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 10:11:30,044 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 10:11:30,044 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 10:11:30,044 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 10:11:30,047 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 10:11:30,049 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 10:11:30,049 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 10:11:30,050 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 10:11:30,050 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 10:11:30,051 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 10:11:30,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 10:11:30,052 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 10:11:30,053 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 10:11:30,054 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 10:11:30,054 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 10:11:30,054 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 10:11:30,055 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 10:11:30,055 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 10:11:30,056 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-16 10:11:30,079 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 10:11:30,081 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 10:11:30,081 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 10:11:30,081 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 10:11:30,083 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 10:11:30,083 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 10:11:30,083 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 10:11:30,083 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-16 10:11:30,083 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-16 10:11:30,083 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-16 10:11:30,084 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-16 10:11:30,084 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-16 10:11:30,084 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-16 10:11:30,084 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 10:11:30,084 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 10:11:30,085 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 10:11:30,085 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 10:11:30,085 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 10:11:30,085 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 10:11:30,085 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-16 10:11:30,085 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-16 10:11:30,085 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-16 10:11:30,085 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 10:11:30,086 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 10:11:30,086 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-16 10:11:30,086 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 10:11:30,086 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-16 10:11:30,086 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 10:11:30,086 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 10:11:30,086 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 10:11:30,087 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 10:11:30,087 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 10:11:30,088 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-16 10:11:30,088 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 -> 2e89791a2e8bde62b11f5e3f45edc8f6b1d8831a0e105552a6da22a3ff44c454 [2021-12-16 10:11:30,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 10:11:30,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 10:11:30,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 10:11:30,306 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 10:11:30,306 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 10:11:30,308 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.6_overflow.ufo.UNBOUNDED.pals.c [2021-12-16 10:11:30,348 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d9b8c395/2b680a6115f24e3eadef6bed10ceaa01/FLAGd8970aa5e [2021-12-16 10:11:30,794 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 10:11:30,795 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.6_overflow.ufo.UNBOUNDED.pals.c [2021-12-16 10:11:30,814 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d9b8c395/2b680a6115f24e3eadef6bed10ceaa01/FLAGd8970aa5e [2021-12-16 10:11:30,826 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d9b8c395/2b680a6115f24e3eadef6bed10ceaa01 [2021-12-16 10:11:30,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 10:11:30,831 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 10:11:30,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 10:11:30,833 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 10:11:30,835 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 10:11:30,836 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 10:11:30" (1/1) ... [2021-12-16 10:11:30,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13bc842b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:11:30, skipping insertion in model container [2021-12-16 10:11:30,837 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 10:11:30" (1/1) ... [2021-12-16 10:11:30,841 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 10:11:30,876 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 10:11:31,104 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.6_overflow.ufo.UNBOUNDED.pals.c[15177,15190] [2021-12-16 10:11:31,110 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 10:11:31,118 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 10:11:31,156 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.6_overflow.ufo.UNBOUNDED.pals.c[15177,15190] [2021-12-16 10:11:31,156 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 10:11:31,166 INFO L208 MainTranslator]: Completed translation [2021-12-16 10:11:31,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:11:31 WrapperNode [2021-12-16 10:11:31,166 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 10:11:31,167 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 10:11:31,167 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 10:11:31,167 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 10:11:31,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:11:31" (1/1) ... [2021-12-16 10:11:31,187 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:11:31" (1/1) ... [2021-12-16 10:11:31,216 INFO L137 Inliner]: procedures = 26, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 368 [2021-12-16 10:11:31,216 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 10:11:31,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 10:11:31,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 10:11:31,217 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 10:11:31,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:11:31" (1/1) ... [2021-12-16 10:11:31,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:11:31" (1/1) ... [2021-12-16 10:11:31,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:11:31" (1/1) ... [2021-12-16 10:11:31,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:11:31" (1/1) ... [2021-12-16 10:11:31,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:11:31" (1/1) ... [2021-12-16 10:11:31,234 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:11:31" (1/1) ... [2021-12-16 10:11:31,235 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:11:31" (1/1) ... [2021-12-16 10:11:31,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 10:11:31,238 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 10:11:31,238 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 10:11:31,239 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 10:11:31,251 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:11:31" (1/1) ... [2021-12-16 10:11:31,256 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:11:31,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:11:31,278 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:11:31,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-16 10:11:31,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 10:11:31,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 10:11:31,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 10:11:31,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 10:11:31,378 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 10:11:31,379 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 10:11:31,724 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 10:11:31,733 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 10:11:31,734 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-16 10:11:31,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 10:11:31 BoogieIcfgContainer [2021-12-16 10:11:31,736 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 10:11:31,738 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-16 10:11:31,738 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-16 10:11:31,740 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-16 10:11:31,741 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 10:11:31,741 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.12 10:11:30" (1/3) ... [2021-12-16 10:11:31,742 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b4cc1d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.12 10:11:31, skipping insertion in model container [2021-12-16 10:11:31,742 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 10:11:31,742 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:11:31" (2/3) ... [2021-12-16 10:11:31,743 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b4cc1d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.12 10:11:31, skipping insertion in model container [2021-12-16 10:11:31,743 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 10:11:31,743 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 10:11:31" (3/3) ... [2021-12-16 10:11:31,744 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr.6_overflow.ufo.UNBOUNDED.pals.c [2021-12-16 10:11:31,779 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-16 10:11:31,779 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-16 10:11:31,780 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-16 10:11:31,780 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-16 10:11:31,780 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-16 10:11:31,780 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-16 10:11:31,780 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-16 10:11:31,780 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-16 10:11:31,794 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 109 states, 108 states have (on average 1.7314814814814814) internal successors, (187), 108 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:11:31,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2021-12-16 10:11:31,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:11:31,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:11:31,821 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:11:31,821 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:11:31,821 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-16 10:11:31,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 109 states, 108 states have (on average 1.7314814814814814) internal successors, (187), 108 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:11:31,826 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2021-12-16 10:11:31,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:11:31,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:11:31,829 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:11:31,829 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:11:31,834 INFO L791 eck$LassoCheckResult]: Stem: 92#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(41, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; 28#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#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~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 59#L230true assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; 104#L230-1true init_#res#1 := init_~tmp~0#1; 68#L391true main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 33#L24true assume !(0 == assume_abort_if_not_~cond#1); 11#L23true assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 25#L469-2true [2021-12-16 10:11:31,835 INFO L793 eck$LassoCheckResult]: Loop: 25#L469-2true assume !false;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; 9#L80true assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 90#L84true assume !(node1_~m1~0#1 != ~nomsg~0); 98#L84-1true ~mode1~0 := 0; 15#L80-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 89#L106true assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 84#L109true assume !(node2_~m2~0#1 != ~nomsg~0); 94#L109-1true ~mode2~0 := 0; 35#L106-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 29#L131true assume !(0 != ~mode3~0 % 256); 6#L144true assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 58#L144-2true ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 74#L131-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 102#L156true assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 60#L159true assume !(node4_~m4~0#1 != ~nomsg~0); 80#L159-1true ~mode4~0 := 0; 27#L156-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 73#L181true assume !(0 != ~mode5~0 % 256); 75#L194true assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 101#L194-2true ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 31#L181-2true assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 24#L206true assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 83#L209true assume !(node6_~m6~0#1 != ~nomsg~0); 108#L209-1true ~mode6~0 := 0; 55#L206-2true assume { :end_inline_node6 } 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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 52#L399true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 97#L399-1true check_#res#1 := check_~tmp~1#1; 4#L419true main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; 32#L501true assume !(0 == assert_~arg#1 % 256); 66#L496true assume { :end_inline_assert } true; 25#L469-2true [2021-12-16 10:11:31,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:11:31,838 INFO L85 PathProgramCache]: Analyzing trace with hash 2030119858, now seen corresponding path program 1 times [2021-12-16 10:11:31,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:11:31,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569619764] [2021-12-16 10:11:31,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:11:31,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:11:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:11:32,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 10:11:32,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:11:32,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569619764] [2021-12-16 10:11:32,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569619764] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:11:32,006 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:11:32,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 10:11:32,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119649549] [2021-12-16 10:11:32,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:11:32,011 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 10:11:32,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:11:32,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1889928533, now seen corresponding path program 1 times [2021-12-16 10:11:32,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:11:32,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034970309] [2021-12-16 10:11:32,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:11:32,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:11:32,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:11:32,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 10:11:32,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:11:32,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034970309] [2021-12-16 10:11:32,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034970309] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:11:32,133 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:11:32,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 10:11:32,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501944551] [2021-12-16 10:11:32,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:11:32,135 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 10:11:32,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:11:32,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 10:11:32,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 10:11:32,162 INFO L87 Difference]: Start difference. First operand has 109 states, 108 states have (on average 1.7314814814814814) internal successors, (187), 108 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:11:32,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:11:32,261 INFO L93 Difference]: Finished difference Result 108 states and 182 transitions. [2021-12-16 10:11:32,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 10:11:32,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 182 transitions. [2021-12-16 10:11:32,268 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2021-12-16 10:11:32,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 104 states and 139 transitions. [2021-12-16 10:11:32,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2021-12-16 10:11:32,273 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2021-12-16 10:11:32,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 139 transitions. [2021-12-16 10:11:32,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:11:32,274 INFO L681 BuchiCegarLoop]: Abstraction has 104 states and 139 transitions. [2021-12-16 10:11:32,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 139 transitions. [2021-12-16 10:11:32,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-12-16 10:11:32,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.3365384615384615) internal successors, (139), 103 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:11:32,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 139 transitions. [2021-12-16 10:11:32,295 INFO L704 BuchiCegarLoop]: Abstraction has 104 states and 139 transitions. [2021-12-16 10:11:32,295 INFO L587 BuchiCegarLoop]: Abstraction has 104 states and 139 transitions. [2021-12-16 10:11:32,295 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-16 10:11:32,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 139 transitions. [2021-12-16 10:11:32,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2021-12-16 10:11:32,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:11:32,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:11:32,297 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:11:32,298 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:11:32,298 INFO L791 eck$LassoCheckResult]: Stem: 337#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(41, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; 277#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#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~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 278#L230 assume 0 == ~r1~0 % 256; 319#L231 assume ~id1~0 >= 0; 323#L232 assume 0 == ~st1~0; 308#L233 assume ~send1~0 == ~id1~0; 309#L234 assume 0 == ~mode1~0 % 256; 318#L235 assume ~id2~0 >= 0; 301#L236 assume 0 == ~st2~0; 302#L237 assume ~send2~0 == ~id2~0; 263#L238 assume 0 == ~mode2~0 % 256; 264#L239 assume ~id3~0 >= 0; 261#L240 assume 0 == ~st3~0; 262#L241 assume ~send3~0 == ~id3~0; 266#L242 assume 0 == ~mode3~0 % 256; 322#L243 assume ~id4~0 >= 0; 241#L244 assume 0 == ~st4~0; 242#L245 assume ~send4~0 == ~id4~0; 265#L246 assume 0 == ~mode4~0 % 256; 307#L247 assume ~id5~0 >= 0; 333#L248 assume 0 == ~st5~0; 237#L249 assume ~send5~0 == ~id5~0; 238#L250 assume 0 == ~mode5~0 % 256; 324#L251 assume ~id6~0 >= 0; 288#L252 assume 0 == ~st6~0; 289#L253 assume ~send6~0 == ~id6~0; 296#L254 assume 0 == ~mode6~0 % 256; 255#L255 assume ~id1~0 != ~id2~0; 256#L256 assume ~id1~0 != ~id3~0; 290#L257 assume ~id1~0 != ~id4~0; 267#L258 assume ~id1~0 != ~id5~0; 268#L259 assume ~id1~0 != ~id6~0; 310#L260 assume ~id2~0 != ~id3~0; 311#L261 assume ~id2~0 != ~id4~0; 297#L262 assume ~id2~0 != ~id5~0; 298#L263 assume ~id2~0 != ~id6~0; 303#L264 assume ~id3~0 != ~id4~0; 304#L265 assume ~id3~0 != ~id5~0; 249#L266 assume ~id3~0 != ~id6~0; 250#L267 assume ~id4~0 != ~id5~0; 259#L268 assume ~id4~0 != ~id6~0; 260#L269 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 305#L230-1 init_#res#1 := init_~tmp~0#1; 327#L391 main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 285#L24 assume !(0 == assume_abort_if_not_~cond#1); 251#L23 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 252#L469-2 [2021-12-16 10:11:32,298 INFO L793 eck$LassoCheckResult]: Loop: 252#L469-2 assume !false;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; 246#L80 assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 247#L84 assume !(node1_~m1~0#1 != ~nomsg~0); 274#L84-1 ~mode1~0 := 0; 257#L80-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 258#L106 assume !(0 != ~mode2~0 % 256); 336#L119 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 281#L119-2 ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 282#L106-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 279#L131 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 280#L134 assume !(node3_~m3~0#1 != ~nomsg~0); 286#L134-1 ~mode3~0 := 0; 287#L131-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 329#L156 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 320#L159 assume !(node4_~m4~0#1 != ~nomsg~0); 292#L159-1 ~mode4~0 := 0; 275#L156-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 276#L181 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 325#L184 assume !(node5_~m5~0#1 != ~nomsg~0); 254#L184-1 ~mode5~0 := 0; 283#L181-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 269#L206 assume !(0 != ~mode6~0 % 256); 270#L219 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 338#L219-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 317#L206-2 assume { :end_inline_node6 } 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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 312#L399 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 294#L399-1 check_#res#1 := check_~tmp~1#1; 235#L419 main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; 236#L501 assume !(0 == assert_~arg#1 % 256); 284#L496 assume { :end_inline_assert } true; 252#L469-2 [2021-12-16 10:11:32,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:11:32,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1716035805, now seen corresponding path program 1 times [2021-12-16 10:11:32,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:11:32,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846045429] [2021-12-16 10:11:32,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:11:32,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:11:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:11:32,329 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:11:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:11:32,369 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:11:32,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:11:32,369 INFO L85 PathProgramCache]: Analyzing trace with hash 184711851, now seen corresponding path program 1 times [2021-12-16 10:11:32,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:11:32,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794937205] [2021-12-16 10:11:32,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:11:32,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:11:32,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:11:32,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 10:11:32,431 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:11:32,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794937205] [2021-12-16 10:11:32,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794937205] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:11:32,432 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:11:32,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 10:11:32,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756088403] [2021-12-16 10:11:32,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:11:32,433 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 10:11:32,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:11:32,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 10:11:32,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 10:11:32,433 INFO L87 Difference]: Start difference. First operand 104 states and 139 transitions. cyclomatic complexity: 36 Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:11:32,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:11:32,464 INFO L93 Difference]: Finished difference Result 107 states and 141 transitions. [2021-12-16 10:11:32,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 10:11:32,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 141 transitions. [2021-12-16 10:11:32,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2021-12-16 10:11:32,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 104 states and 136 transitions. [2021-12-16 10:11:32,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2021-12-16 10:11:32,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2021-12-16 10:11:32,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 136 transitions. [2021-12-16 10:11:32,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:11:32,468 INFO L681 BuchiCegarLoop]: Abstraction has 104 states and 136 transitions. [2021-12-16 10:11:32,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 136 transitions. [2021-12-16 10:11:32,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-12-16 10:11:32,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 103 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:11:32,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2021-12-16 10:11:32,472 INFO L704 BuchiCegarLoop]: Abstraction has 104 states and 136 transitions. [2021-12-16 10:11:32,472 INFO L587 BuchiCegarLoop]: Abstraction has 104 states and 136 transitions. [2021-12-16 10:11:32,472 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-16 10:11:32,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 136 transitions. [2021-12-16 10:11:32,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2021-12-16 10:11:32,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:11:32,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:11:32,475 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:11:32,475 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:11:32,475 INFO L791 eck$LassoCheckResult]: Stem: 560#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(41, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; 500#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#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~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 501#L230 assume 0 == ~r1~0 % 256; 541#L231 assume ~id1~0 >= 0; 545#L232 assume 0 == ~st1~0; 530#L233 assume ~send1~0 == ~id1~0; 531#L234 assume 0 == ~mode1~0 % 256; 540#L235 assume ~id2~0 >= 0; 523#L236 assume 0 == ~st2~0; 524#L237 assume ~send2~0 == ~id2~0; 486#L238 assume 0 == ~mode2~0 % 256; 487#L239 assume ~id3~0 >= 0; 484#L240 assume 0 == ~st3~0; 485#L241 assume ~send3~0 == ~id3~0; 489#L242 assume 0 == ~mode3~0 % 256; 544#L243 assume ~id4~0 >= 0; 464#L244 assume 0 == ~st4~0; 465#L245 assume ~send4~0 == ~id4~0; 488#L246 assume 0 == ~mode4~0 % 256; 529#L247 assume ~id5~0 >= 0; 555#L248 assume 0 == ~st5~0; 460#L249 assume ~send5~0 == ~id5~0; 461#L250 assume 0 == ~mode5~0 % 256; 546#L251 assume ~id6~0 >= 0; 511#L252 assume 0 == ~st6~0; 512#L253 assume ~send6~0 == ~id6~0; 518#L254 assume 0 == ~mode6~0 % 256; 478#L255 assume ~id1~0 != ~id2~0; 479#L256 assume ~id1~0 != ~id3~0; 513#L257 assume ~id1~0 != ~id4~0; 490#L258 assume ~id1~0 != ~id5~0; 491#L259 assume ~id1~0 != ~id6~0; 532#L260 assume ~id2~0 != ~id3~0; 533#L261 assume ~id2~0 != ~id4~0; 519#L262 assume ~id2~0 != ~id5~0; 520#L263 assume ~id2~0 != ~id6~0; 525#L264 assume ~id3~0 != ~id4~0; 526#L265 assume ~id3~0 != ~id5~0; 472#L266 assume ~id3~0 != ~id6~0; 473#L267 assume ~id4~0 != ~id5~0; 482#L268 assume ~id4~0 != ~id6~0; 483#L269 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 527#L230-1 init_#res#1 := init_~tmp~0#1; 549#L391 main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 508#L24 assume !(0 == assume_abort_if_not_~cond#1); 474#L23 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 475#L469-2 [2021-12-16 10:11:32,477 INFO L793 eck$LassoCheckResult]: Loop: 475#L469-2 assume !false;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; 469#L80 assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 470#L84 assume !(node1_~m1~0#1 != ~nomsg~0); 497#L84-1 ~mode1~0 := 0; 480#L80-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 481#L106 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 558#L109 assume !(node2_~m2~0#1 != ~nomsg~0); 538#L109-1 ~mode2~0 := 0; 505#L106-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 502#L131 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 503#L134 assume !(node3_~m3~0#1 != ~nomsg~0); 509#L134-1 ~mode3~0 := 0; 510#L131-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 551#L156 assume !(0 != ~mode4~0 % 256); 521#L169 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 522#L169-2 ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 498#L156-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 499#L181 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 547#L184 assume !(node5_~m5~0#1 != ~nomsg~0); 477#L184-1 ~mode5~0 := 0; 506#L181-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 492#L206 assume !(0 != ~mode6~0 % 256); 493#L219 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 561#L219-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 539#L206-2 assume { :end_inline_node6 } 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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 534#L399 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 535#L400 assume ~r1~0 % 256 >= 6; 517#L404 assume ~r1~0 % 256 < 6;check_~tmp~1#1 := 1; 557#L399-1 check_#res#1 := check_~tmp~1#1; 458#L419 main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; 459#L501 assume !(0 == assert_~arg#1 % 256); 507#L496 assume { :end_inline_assert } true; 475#L469-2 [2021-12-16 10:11:32,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:11:32,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1716035805, now seen corresponding path program 2 times [2021-12-16 10:11:32,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:11:32,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703421236] [2021-12-16 10:11:32,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:11:32,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:11:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:11:32,494 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:11:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:11:32,516 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:11:32,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:11:32,517 INFO L85 PathProgramCache]: Analyzing trace with hash 439824187, now seen corresponding path program 1 times [2021-12-16 10:11:32,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:11:32,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881042650] [2021-12-16 10:11:32,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:11:32,517 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:11:32,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:11:32,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 10:11:32,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:11:32,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881042650] [2021-12-16 10:11:32,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881042650] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:11:32,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:11:32,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 10:11:32,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781701490] [2021-12-16 10:11:32,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:11:32,543 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 10:11:32,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:11:32,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 10:11:32,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 10:11:32,544 INFO L87 Difference]: Start difference. First operand 104 states and 136 transitions. cyclomatic complexity: 33 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:11:32,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:11:32,562 INFO L93 Difference]: Finished difference Result 156 states and 215 transitions. [2021-12-16 10:11:32,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 10:11:32,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 215 transitions. [2021-12-16 10:11:32,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 110 [2021-12-16 10:11:32,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 156 states and 215 transitions. [2021-12-16 10:11:32,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2021-12-16 10:11:32,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 156 [2021-12-16 10:11:32,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 215 transitions. [2021-12-16 10:11:32,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:11:32,567 INFO L681 BuchiCegarLoop]: Abstraction has 156 states and 215 transitions. [2021-12-16 10:11:32,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 215 transitions. [2021-12-16 10:11:32,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2021-12-16 10:11:32,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 156 states have (on average 1.3782051282051282) internal successors, (215), 155 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:11:32,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 215 transitions. [2021-12-16 10:11:32,573 INFO L704 BuchiCegarLoop]: Abstraction has 156 states and 215 transitions. [2021-12-16 10:11:32,573 INFO L587 BuchiCegarLoop]: Abstraction has 156 states and 215 transitions. [2021-12-16 10:11:32,573 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-16 10:11:32,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 156 states and 215 transitions. [2021-12-16 10:11:32,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 110 [2021-12-16 10:11:32,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:11:32,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:11:32,596 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:11:32,596 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:11:32,596 INFO L791 eck$LassoCheckResult]: Stem: 828#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(41, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; 766#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#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~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 767#L230 assume 0 == ~r1~0 % 256; 807#L231 assume ~id1~0 >= 0; 812#L232 assume 0 == ~st1~0; 796#L233 assume ~send1~0 == ~id1~0; 797#L234 assume 0 == ~mode1~0 % 256; 806#L235 assume ~id2~0 >= 0; 789#L236 assume 0 == ~st2~0; 790#L237 assume ~send2~0 == ~id2~0; 752#L238 assume 0 == ~mode2~0 % 256; 753#L239 assume ~id3~0 >= 0; 750#L240 assume 0 == ~st3~0; 751#L241 assume ~send3~0 == ~id3~0; 755#L242 assume 0 == ~mode3~0 % 256; 811#L243 assume ~id4~0 >= 0; 730#L244 assume 0 == ~st4~0; 731#L245 assume ~send4~0 == ~id4~0; 754#L246 assume 0 == ~mode4~0 % 256; 795#L247 assume ~id5~0 >= 0; 822#L248 assume 0 == ~st5~0; 726#L249 assume ~send5~0 == ~id5~0; 727#L250 assume 0 == ~mode5~0 % 256; 813#L251 assume ~id6~0 >= 0; 777#L252 assume 0 == ~st6~0; 778#L253 assume ~send6~0 == ~id6~0; 784#L254 assume 0 == ~mode6~0 % 256; 744#L255 assume ~id1~0 != ~id2~0; 745#L256 assume ~id1~0 != ~id3~0; 779#L257 assume ~id1~0 != ~id4~0; 756#L258 assume ~id1~0 != ~id5~0; 757#L259 assume ~id1~0 != ~id6~0; 798#L260 assume ~id2~0 != ~id3~0; 799#L261 assume ~id2~0 != ~id4~0; 785#L262 assume ~id2~0 != ~id5~0; 786#L263 assume ~id2~0 != ~id6~0; 791#L264 assume ~id3~0 != ~id4~0; 792#L265 assume ~id3~0 != ~id5~0; 738#L266 assume ~id3~0 != ~id6~0; 739#L267 assume ~id4~0 != ~id5~0; 748#L268 assume ~id4~0 != ~id6~0; 749#L269 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 793#L230-1 init_#res#1 := init_~tmp~0#1; 816#L391 main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 774#L24 assume !(0 == assume_abort_if_not_~cond#1); 740#L23 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 741#L469-2 [2021-12-16 10:11:32,597 INFO L793 eck$LassoCheckResult]: Loop: 741#L469-2 assume !false;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; 735#L80 assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 736#L84 assume !(node1_~m1~0#1 != ~nomsg~0); 763#L84-1 ~mode1~0 := 0; 746#L80-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 747#L106 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 826#L109 assume !(node2_~m2~0#1 != ~nomsg~0); 804#L109-1 ~mode2~0 := 0; 771#L106-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 768#L131 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 769#L134 assume !(node3_~m3~0#1 != ~nomsg~0); 775#L134-1 ~mode3~0 := 0; 776#L131-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 818#L156 assume !(0 != ~mode4~0 % 256); 787#L169 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 788#L169-2 ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 764#L156-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 765#L181 assume !(0 != ~mode5~0 % 256); 817#L194 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 819#L194-2 ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 772#L181-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 758#L206 assume !(0 != ~mode6~0 % 256); 759#L219 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 835#L219-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 834#L206-2 assume { :end_inline_node6 } 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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 833#L399 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 832#L400 assume !(~r1~0 % 256 >= 6); 782#L403 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; 783#L404 assume ~r1~0 % 256 < 6;check_~tmp~1#1 := 1; 829#L399-1 check_#res#1 := check_~tmp~1#1; 724#L419 main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; 725#L501 assume !(0 == assert_~arg#1 % 256); 773#L496 assume { :end_inline_assert } true; 741#L469-2 [2021-12-16 10:11:32,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:11:32,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1716035805, now seen corresponding path program 3 times [2021-12-16 10:11:32,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:11:32,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210735317] [2021-12-16 10:11:32,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:11:32,598 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:11:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:11:32,613 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:11:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:11:32,642 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:11:32,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:11:32,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1811628521, now seen corresponding path program 1 times [2021-12-16 10:11:32,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:11:32,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677426847] [2021-12-16 10:11:32,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:11:32,649 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:11:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:11:32,670 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:11:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:11:32,699 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:11:32,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:11:32,699 INFO L85 PathProgramCache]: Analyzing trace with hash 892160821, now seen corresponding path program 1 times [2021-12-16 10:11:32,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:11:32,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863896511] [2021-12-16 10:11:32,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:11:32,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:11:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:11:32,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 10:11:32,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:11:32,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863896511] [2021-12-16 10:11:32,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863896511] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:11:32,773 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:11:32,773 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 10:11:32,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106445560] [2021-12-16 10:11:32,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:11:33,876 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 10:11:33,877 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 10:11:33,877 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 10:11:33,877 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 10:11:33,877 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-16 10:11:33,877 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:11:33,877 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 10:11:33,877 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 10:11:33,878 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.6_overflow.ufo.UNBOUNDED.pals.c_Iteration4_Loop [2021-12-16 10:11:33,878 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 10:11:33,878 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 10:11:33,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:11:33,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:11:33,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:11:33,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:11:33,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:11:33,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:11:33,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:11:34,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:11:34,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:11:34,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:11:34,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:11:34,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:11:34,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:11:34,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:11:34,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:11:34,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:11:34,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:11:34,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:11:34,495 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2021-12-16 10:12:09,174 WARN L227 SmtUtils]: Spent 34.49s on a formula simplification. DAG size of input: 647 DAG size of output: 199 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2021-12-16 10:12:09,274 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 10:12:09,275 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-16 10:12:09,276 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:12:09,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:12:09,277 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:12:09,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-16 10:12:09,291 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 10:12:09,292 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 10:12:09,351 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 [2021-12-16 10:12:09,351 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:12:09,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:12:09,352 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:12:09,356 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-16 10:12:09,356 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 10:12:09,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-16 10:12:09,439 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-16 10:12:09,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-16 10:12:09,444 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 10:12:09,444 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 10:12:09,444 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 10:12:09,444 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 10:12:09,445 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 10:12:09,445 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:12:09,445 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 10:12:09,445 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 10:12:09,445 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.6_overflow.ufo.UNBOUNDED.pals.c_Iteration4_Loop [2021-12-16 10:12:09,445 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 10:12:09,445 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 10:12:09,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:12:09,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:12:09,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:12:09,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:12:09,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:12:09,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:12:09,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:12:09,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:12:09,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:12:09,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:12:09,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:12:09,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:12:09,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:12:09,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:12:09,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:12:09,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:12:09,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:12:09,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:12:09,994 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9