./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3a877d22 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.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 648a34748ee6f317001c61f0628c2e00b2100c77ff87e7d85b52ec2f91d6d096 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:22:51,894 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:22:51,896 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:22:51,917 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:22:51,918 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:22:51,918 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:22:51,919 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:22:51,929 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:22:51,931 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:22:51,936 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:22:51,936 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:22:51,937 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:22:51,938 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:22:51,939 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:22:51,940 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:22:51,942 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:22:51,944 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:22:51,945 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:22:51,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:22:51,950 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:22:51,952 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:22:51,952 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:22:51,953 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:22:51,961 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:22:51,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:22:51,965 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:22:51,965 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:22:51,966 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:22:51,967 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:22:51,967 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:22:51,968 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:22:51,968 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:22:51,969 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:22:51,970 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:22:51,971 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:22:51,971 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:22:51,971 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:22:51,972 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:22:51,972 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:22:51,972 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:22:51,973 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:22:51,973 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-15 17:22:52,000 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:22:52,002 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:22:52,003 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:22:52,003 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:22:52,004 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:22:52,004 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:22:52,004 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:22:52,004 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:22:52,004 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:22:52,005 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:22:52,005 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:22:52,005 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:22:52,006 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:22:52,006 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:22:52,006 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:22:52,006 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:22:52,006 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:22:52,006 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:22:52,007 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:22:52,007 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:22:52,007 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:22:52,007 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:22:52,008 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:22:52,008 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:22:52,008 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:22:52,008 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:22:52,008 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:22:52,008 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:22:52,009 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:22:52,009 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:22:52,009 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:22:52,009 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:22:52,010 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:22:52,010 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 -> 648a34748ee6f317001c61f0628c2e00b2100c77ff87e7d85b52ec2f91d6d096 [2021-12-15 17:22:52,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:22:52,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:22:52,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:22:52,238 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:22:52,239 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:22:52,240 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c [2021-12-15 17:22:52,276 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1e1348f5/f97d797dedd6406babbdd18917f7522e/FLAG1ceae63aa [2021-12-15 17:22:52,673 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:22:52,673 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c [2021-12-15 17:22:52,684 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1e1348f5/f97d797dedd6406babbdd18917f7522e/FLAG1ceae63aa [2021-12-15 17:22:52,697 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1e1348f5/f97d797dedd6406babbdd18917f7522e [2021-12-15 17:22:52,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:22:52,701 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:22:52,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:22:52,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:22:52,705 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:22:52,706 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:22:52" (1/1) ... [2021-12-15 17:22:52,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d1c6a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:52, skipping insertion in model container [2021-12-15 17:22:52,707 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:22:52" (1/1) ... [2021-12-15 17:22:52,712 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:22:52,738 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:22:52,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c[16824,16837] [2021-12-15 17:22:52,889 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:22:52,895 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:22:52,943 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c[16824,16837] [2021-12-15 17:22:52,944 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:22:52,953 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:22:52,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:52 WrapperNode [2021-12-15 17:22:52,959 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:22:52,960 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:22:52,960 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:22:52,960 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:22:52,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:52" (1/1) ... [2021-12-15 17:22:52,978 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:52" (1/1) ... [2021-12-15 17:22:53,010 INFO L137 Inliner]: procedures = 25, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 434 [2021-12-15 17:22:53,010 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:22:53,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:22:53,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:22:53,011 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:22:53,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:52" (1/1) ... [2021-12-15 17:22:53,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:52" (1/1) ... [2021-12-15 17:22:53,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:52" (1/1) ... [2021-12-15 17:22:53,030 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:52" (1/1) ... [2021-12-15 17:22:53,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:52" (1/1) ... [2021-12-15 17:22:53,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:52" (1/1) ... [2021-12-15 17:22:53,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:52" (1/1) ... [2021-12-15 17:22:53,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:22:53,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:22:53,059 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:22:53,059 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:22:53,060 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:52" (1/1) ... [2021-12-15 17:22:53,064 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:22:53,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:22:53,082 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-15 17:22:53,111 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-15 17:22:53,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:22:53,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:22:53,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:22:53,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:22:53,241 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:22:53,242 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:22:53,517 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:22:53,525 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:22:53,526 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 17:22:53,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:22:53 BoogieIcfgContainer [2021-12-15 17:22:53,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:22:53,528 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:22:53,528 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:22:53,531 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:22:53,531 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:53,531 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:22:52" (1/3) ... [2021-12-15 17:22:53,532 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27fb8867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:22:53, skipping insertion in model container [2021-12-15 17:22:53,532 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:53,532 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:52" (2/3) ... [2021-12-15 17:22:53,532 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27fb8867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:22:53, skipping insertion in model container [2021-12-15 17:22:53,532 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:53,533 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:22:53" (3/3) ... [2021-12-15 17:22:53,533 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c [2021-12-15 17:22:53,560 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:22:53,560 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:22:53,560 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:22:53,560 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:22:53,560 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:22:53,560 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:22:53,561 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:22:53,561 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:22:53,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 141 states, 140 states have (on average 1.7142857142857142) internal successors, (240), 140 states have internal predecessors, (240), 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-15 17:22:53,598 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2021-12-15 17:22:53,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:53,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:53,612 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:53,613 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-15 17:22:53,613 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:22:53,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 141 states, 140 states have (on average 1.7142857142857142) internal successors, (240), 140 states have internal predecessors, (240), 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-15 17:22:53,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2021-12-15 17:22:53,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:53,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:53,642 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:53,642 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-15 17:22:53,647 INFO L791 eck$LassoCheckResult]: Stem: 129#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(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~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;~alive6~0 := 0; 38#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~ret46#1, main_#t~ret47#1, main_#t~post48#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~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~send3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~alive3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~alive4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~alive5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id6~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~alive6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 122#L285true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 55#L285-1true init_#res#1 := init_~tmp~0#1; 99#L450true main_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret46#1;havoc main_#t~ret46#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; 41#L22true assume 0 == assume_abort_if_not_~cond#1;assume false; 104#L21true 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; 109#L526-2true [2021-12-15 17:22:53,648 INFO L793 eck$LassoCheckResult]: Loop: 109#L526-2true assume !!(main_~i2~0#1 < 12);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; 126#L84true assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 100#L88true assume !(node1_~m1~0#1 != ~nomsg~0); 124#L88-1true ~mode1~0 := 0; 24#L84-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 29#L116true assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 130#L119true assume !(node2_~m2~0#1 != ~nomsg~0); 28#L119-1true ~mode2~0 := 0; 121#L116-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 106#L150true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 9#L153true assume !(node3_~m3~0#1 != ~nomsg~0); 89#L153-1true ~mode3~0 := 0; 93#L150-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 86#L184true assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 132#L187true assume !(node4_~m4~0#1 != ~nomsg~0); 108#L187-1true ~mode4~0 := 0; 80#L184-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 39#L218true assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 91#L221true assume !(node5_~m5~0#1 != ~nomsg~0); 56#L221-1true ~mode5~0 := 0; 14#L218-2true assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite13#1, node6_#t~ite14#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 52#L252true assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 19#L255true assume !(node6_~m6~0#1 != ~nomsg~0); 35#L255-1true ~mode6~0 := 0; 141#L252-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; 112#L458true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 137#L458-1true check_#res#1 := check_~tmp~1#1; 113#L470true main_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret47#1;havoc main_#t~ret47#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; 45#L559true assume !(0 == assert_~arg#1 % 256); 143#L554true assume { :end_inline_assert } true;main_#t~post48#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post48#1;havoc main_#t~post48#1; 109#L526-2true [2021-12-15 17:22:53,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:53,657 INFO L85 PathProgramCache]: Analyzing trace with hash 2035845626, now seen corresponding path program 1 times [2021-12-15 17:22:53,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:53,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756403866] [2021-12-15 17:22:53,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:53,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:53,814 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-15 17:22:53,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:53,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756403866] [2021-12-15 17:22:53,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756403866] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:53,817 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:53,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 17:22:53,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871435928] [2021-12-15 17:22:53,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:53,821 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:22:53,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:53,824 INFO L85 PathProgramCache]: Analyzing trace with hash 959479027, now seen corresponding path program 1 times [2021-12-15 17:22:53,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:53,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509209534] [2021-12-15 17:22:53,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:53,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:53,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:53,983 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-15 17:22:53,983 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:53,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509209534] [2021-12-15 17:22:53,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509209534] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:53,983 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:53,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:53,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281022113] [2021-12-15 17:22:53,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:53,985 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:53,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:54,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 17:22:54,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 17:22:54,006 INFO L87 Difference]: Start difference. First operand has 141 states, 140 states have (on average 1.7142857142857142) internal successors, (240), 140 states have internal predecessors, (240), 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 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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-15 17:22:54,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:54,016 INFO L93 Difference]: Finished difference Result 141 states and 237 transitions. [2021-12-15 17:22:54,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 17:22:54,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 237 transitions. [2021-12-15 17:22:54,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2021-12-15 17:22:54,025 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 136 states and 232 transitions. [2021-12-15 17:22:54,026 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 136 [2021-12-15 17:22:54,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2021-12-15 17:22:54,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 232 transitions. [2021-12-15 17:22:54,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:54,029 INFO L681 BuchiCegarLoop]: Abstraction has 136 states and 232 transitions. [2021-12-15 17:22:54,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 232 transitions. [2021-12-15 17:22:54,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2021-12-15 17:22:54,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 136 states have (on average 1.7058823529411764) internal successors, (232), 135 states have internal predecessors, (232), 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-15 17:22:54,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 232 transitions. [2021-12-15 17:22:54,060 INFO L704 BuchiCegarLoop]: Abstraction has 136 states and 232 transitions. [2021-12-15 17:22:54,060 INFO L587 BuchiCegarLoop]: Abstraction has 136 states and 232 transitions. [2021-12-15 17:22:54,060 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:22:54,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 232 transitions. [2021-12-15 17:22:54,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2021-12-15 17:22:54,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:54,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:54,067 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:54,067 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-15 17:22:54,068 INFO L791 eck$LassoCheckResult]: Stem: 427#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(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~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;~alive6~0 := 0; 355#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~ret46#1, main_#t~ret47#1, main_#t~post48#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~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~send3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~alive3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~alive4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~alive5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id6~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~alive6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 356#L285 assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 294#L285-1 init_#res#1 := init_~tmp~0#1; 378#L450 main_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret46#1;havoc main_#t~ret46#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; 360#L22 assume !(0 == assume_abort_if_not_~cond#1); 361#L21 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; 418#L526-2 [2021-12-15 17:22:54,068 INFO L793 eck$LassoCheckResult]: Loop: 418#L526-2 assume !!(main_~i2~0#1 < 12);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; 422#L84 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 416#L88 assume !(node1_~m1~0#1 != ~nomsg~0); 353#L88-1 ~mode1~0 := 0; 337#L84-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 338#L116 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 347#L119 assume !(node2_~m2~0#1 != ~nomsg~0); 340#L119-1 ~mode2~0 := 0; 345#L116-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 420#L150 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 305#L153 assume !(node3_~m3~0#1 != ~nomsg~0); 307#L153-1 ~mode3~0 := 0; 373#L150-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 409#L184 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 410#L187 assume !(node4_~m4~0#1 != ~nomsg~0); 323#L187-1 ~mode4~0 := 0; 404#L184-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 357#L218 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 359#L221 assume !(node5_~m5~0#1 != ~nomsg~0); 312#L221-1 ~mode5~0 := 0; 315#L218-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite13#1, node6_#t~ite14#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 316#L252 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 325#L255 assume !(node6_~m6~0#1 != ~nomsg~0); 327#L255-1 ~mode6~0 := 0; 329#L252-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; 423#L458 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 303#L458-1 check_#res#1 := check_~tmp~1#1; 424#L470 main_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret47#1;havoc main_#t~ret47#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; 366#L559 assume !(0 == assert_~arg#1 % 256); 367#L554 assume { :end_inline_assert } true;main_#t~post48#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post48#1;havoc main_#t~post48#1; 418#L526-2 [2021-12-15 17:22:54,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:54,069 INFO L85 PathProgramCache]: Analyzing trace with hash 2035845688, now seen corresponding path program 1 times [2021-12-15 17:22:54,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:54,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166125531] [2021-12-15 17:22:54,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:54,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:54,100 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-15 17:22:54,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:54,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166125531] [2021-12-15 17:22:54,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166125531] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:54,101 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:54,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:54,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622880306] [2021-12-15 17:22:54,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:54,102 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:22:54,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:54,102 INFO L85 PathProgramCache]: Analyzing trace with hash 959479027, now seen corresponding path program 2 times [2021-12-15 17:22:54,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:54,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378043982] [2021-12-15 17:22:54,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:54,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:54,171 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-15 17:22:54,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:54,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378043982] [2021-12-15 17:22:54,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378043982] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:54,173 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:54,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:54,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338867109] [2021-12-15 17:22:54,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:54,174 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:54,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:54,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:22:54,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:22:54,175 INFO L87 Difference]: Start difference. First operand 136 states and 232 transitions. cyclomatic complexity: 97 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-15 17:22:54,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:54,265 INFO L93 Difference]: Finished difference Result 139 states and 234 transitions. [2021-12-15 17:22:54,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:22:54,266 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 234 transitions. [2021-12-15 17:22:54,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2021-12-15 17:22:54,273 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 136 states and 191 transitions. [2021-12-15 17:22:54,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 136 [2021-12-15 17:22:54,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2021-12-15 17:22:54,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 191 transitions. [2021-12-15 17:22:54,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:54,277 INFO L681 BuchiCegarLoop]: Abstraction has 136 states and 191 transitions. [2021-12-15 17:22:54,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 191 transitions. [2021-12-15 17:22:54,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2021-12-15 17:22:54,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 136 states have (on average 1.4044117647058822) internal successors, (191), 135 states have internal predecessors, (191), 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-15 17:22:54,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 191 transitions. [2021-12-15 17:22:54,281 INFO L704 BuchiCegarLoop]: Abstraction has 136 states and 191 transitions. [2021-12-15 17:22:54,282 INFO L587 BuchiCegarLoop]: Abstraction has 136 states and 191 transitions. [2021-12-15 17:22:54,282 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:22:54,282 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 191 transitions. [2021-12-15 17:22:54,283 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2021-12-15 17:22:54,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:54,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:54,284 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, 1] [2021-12-15 17:22:54,284 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-15 17:22:54,284 INFO L791 eck$LassoCheckResult]: Stem: 717#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(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~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;~alive6~0 := 0; 644#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~ret46#1, main_#t~ret47#1, main_#t~post48#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~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~send3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~alive3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~alive4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~alive5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id6~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~alive6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 645#L285 assume 0 == ~r1~0; 702#L286 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 679#L287 assume ~id1~0 >= 0; 632#L288 assume 0 == ~st1~0; 633#L289 assume ~send1~0 == ~id1~0; 640#L290 assume 0 == ~mode1~0 % 256; 693#L291 assume ~id2~0 >= 0; 694#L292 assume 0 == ~st2~0; 705#L293 assume ~send2~0 == ~id2~0; 716#L294 assume 0 == ~mode2~0 % 256; 589#L295 assume ~id3~0 >= 0; 590#L296 assume 0 == ~st3~0; 639#L297 assume ~send3~0 == ~id3~0; 637#L298 assume 0 == ~mode3~0 % 256; 638#L299 assume ~id4~0 >= 0; 643#L300 assume 0 == ~st4~0; 684#L301 assume ~send4~0 == ~id4~0; 697#L302 assume 0 == ~mode4~0 % 256; 698#L303 assume ~id5~0 >= 0; 711#L304 assume 0 == ~st5~0; 673#L305 assume ~send5~0 == ~id5~0; 674#L306 assume 0 == ~mode5~0 % 256; 691#L307 assume ~id6~0 >= 0; 602#L308 assume 0 == ~st6~0; 603#L309 assume ~send6~0 == ~id6~0; 688#L310 assume 0 == ~mode6~0 % 256; 663#L311 assume ~id1~0 != ~id2~0; 664#L312 assume ~id1~0 != ~id3~0; 621#L313 assume ~id1~0 != ~id4~0; 622#L314 assume ~id1~0 != ~id5~0; 655#L315 assume ~id1~0 != ~id6~0; 656#L316 assume ~id2~0 != ~id3~0; 585#L317 assume ~id2~0 != ~id4~0; 586#L318 assume ~id2~0 != ~id5~0; 718#L319 assume ~id2~0 != ~id6~0; 696#L320 assume ~id3~0 != ~id4~0; 680#L321 assume ~id3~0 != ~id5~0; 681#L322 assume ~id3~0 != ~id6~0; 583#L323 assume ~id4~0 != ~id5~0; 584#L324 assume ~id4~0 != ~id6~0; 607#L325 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 667#L285-1 init_#res#1 := init_~tmp~0#1; 668#L450 main_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret46#1;havoc main_#t~ret46#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; 649#L22 assume !(0 == assume_abort_if_not_~cond#1); 650#L21 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; 708#L526-2 [2021-12-15 17:22:54,284 INFO L793 eck$LassoCheckResult]: Loop: 708#L526-2 assume !!(main_~i2~0#1 < 12);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; 712#L84 assume !(0 != ~mode1~0 % 256); 658#L102 assume !(0 != ~alive1~0 % 256); 657#L102-2 ~mode1~0 := 1; 629#L84-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 630#L116 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 636#L119 assume !(node2_~m2~0#1 != ~nomsg~0); 627#L119-1 ~mode2~0 := 0; 634#L116-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 710#L150 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 594#L153 assume !(node3_~m3~0#1 != ~nomsg~0); 596#L153-1 ~mode3~0 := 0; 662#L150-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 699#L184 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 700#L187 assume !(node4_~m4~0#1 != ~nomsg~0); 612#L187-1 ~mode4~0 := 0; 692#L184-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 646#L218 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 648#L221 assume !(node5_~m5~0#1 != ~nomsg~0); 601#L221-1 ~mode5~0 := 0; 604#L218-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite13#1, node6_#t~ite14#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 605#L252 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 614#L255 assume !(node6_~m6~0#1 != ~nomsg~0); 616#L255-1 ~mode6~0 := 0; 618#L252-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; 713#L458 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 592#L458-1 check_#res#1 := check_~tmp~1#1; 714#L470 main_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret47#1;havoc main_#t~ret47#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; 653#L559 assume !(0 == assert_~arg#1 % 256); 654#L554 assume { :end_inline_assert } true;main_#t~post48#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post48#1;havoc main_#t~post48#1; 708#L526-2 [2021-12-15 17:22:54,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:54,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1766357374, now seen corresponding path program 1 times [2021-12-15 17:22:54,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:54,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667295450] [2021-12-15 17:22:54,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:54,286 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:54,335 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:54,371 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:54,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:54,372 INFO L85 PathProgramCache]: Analyzing trace with hash 225391629, now seen corresponding path program 1 times [2021-12-15 17:22:54,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:54,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511787795] [2021-12-15 17:22:54,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:54,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:54,439 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-15 17:22:54,439 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:54,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511787795] [2021-12-15 17:22:54,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511787795] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:54,439 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:54,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:54,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477298193] [2021-12-15 17:22:54,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:54,440 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:54,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:54,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:22:54,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:22:54,440 INFO L87 Difference]: Start difference. First operand 136 states and 191 transitions. cyclomatic complexity: 56 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-15 17:22:54,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:54,466 INFO L93 Difference]: Finished difference Result 139 states and 193 transitions. [2021-12-15 17:22:54,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:22:54,467 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 193 transitions. [2021-12-15 17:22:54,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2021-12-15 17:22:54,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 136 states and 189 transitions. [2021-12-15 17:22:54,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 136 [2021-12-15 17:22:54,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2021-12-15 17:22:54,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 189 transitions. [2021-12-15 17:22:54,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:54,472 INFO L681 BuchiCegarLoop]: Abstraction has 136 states and 189 transitions. [2021-12-15 17:22:54,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 189 transitions. [2021-12-15 17:22:54,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2021-12-15 17:22:54,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 136 states have (on average 1.3897058823529411) internal successors, (189), 135 states have internal predecessors, (189), 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-15 17:22:54,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 189 transitions. [2021-12-15 17:22:54,488 INFO L704 BuchiCegarLoop]: Abstraction has 136 states and 189 transitions. [2021-12-15 17:22:54,488 INFO L587 BuchiCegarLoop]: Abstraction has 136 states and 189 transitions. [2021-12-15 17:22:54,488 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:22:54,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 189 transitions. [2021-12-15 17:22:54,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2021-12-15 17:22:54,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:54,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:54,491 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, 1] [2021-12-15 17:22:54,492 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] [2021-12-15 17:22:54,492 INFO L791 eck$LassoCheckResult]: Stem: 1004#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(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~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;~alive6~0 := 0; 931#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~ret46#1, main_#t~ret47#1, main_#t~post48#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~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~send3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~alive3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~alive4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~alive5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id6~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~alive6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 932#L285 assume 0 == ~r1~0; 989#L286 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 966#L287 assume ~id1~0 >= 0; 919#L288 assume 0 == ~st1~0; 920#L289 assume ~send1~0 == ~id1~0; 927#L290 assume 0 == ~mode1~0 % 256; 980#L291 assume ~id2~0 >= 0; 981#L292 assume 0 == ~st2~0; 992#L293 assume ~send2~0 == ~id2~0; 1003#L294 assume 0 == ~mode2~0 % 256; 876#L295 assume ~id3~0 >= 0; 877#L296 assume 0 == ~st3~0; 926#L297 assume ~send3~0 == ~id3~0; 924#L298 assume 0 == ~mode3~0 % 256; 925#L299 assume ~id4~0 >= 0; 930#L300 assume 0 == ~st4~0; 971#L301 assume ~send4~0 == ~id4~0; 984#L302 assume 0 == ~mode4~0 % 256; 985#L303 assume ~id5~0 >= 0; 998#L304 assume 0 == ~st5~0; 960#L305 assume ~send5~0 == ~id5~0; 961#L306 assume 0 == ~mode5~0 % 256; 978#L307 assume ~id6~0 >= 0; 889#L308 assume 0 == ~st6~0; 890#L309 assume ~send6~0 == ~id6~0; 975#L310 assume 0 == ~mode6~0 % 256; 950#L311 assume ~id1~0 != ~id2~0; 951#L312 assume ~id1~0 != ~id3~0; 908#L313 assume ~id1~0 != ~id4~0; 909#L314 assume ~id1~0 != ~id5~0; 943#L315 assume ~id1~0 != ~id6~0; 944#L316 assume ~id2~0 != ~id3~0; 872#L317 assume ~id2~0 != ~id4~0; 873#L318 assume ~id2~0 != ~id5~0; 1005#L319 assume ~id2~0 != ~id6~0; 983#L320 assume ~id3~0 != ~id4~0; 967#L321 assume ~id3~0 != ~id5~0; 968#L322 assume ~id3~0 != ~id6~0; 870#L323 assume ~id4~0 != ~id5~0; 871#L324 assume ~id4~0 != ~id6~0; 894#L325 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 954#L285-1 init_#res#1 := init_~tmp~0#1; 955#L450 main_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret46#1;havoc main_#t~ret46#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; 936#L22 assume !(0 == assume_abort_if_not_~cond#1); 937#L21 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; 995#L526-2 [2021-12-15 17:22:54,492 INFO L793 eck$LassoCheckResult]: Loop: 995#L526-2 assume !!(main_~i2~0#1 < 12);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; 999#L84 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 993#L88 assume !(node1_~m1~0#1 != ~nomsg~0); 929#L88-1 ~mode1~0 := 0; 913#L84-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 914#L116 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 923#L119 assume !(node2_~m2~0#1 != ~nomsg~0); 916#L119-1 ~mode2~0 := 0; 921#L116-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 997#L150 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 881#L153 assume !(node3_~m3~0#1 != ~nomsg~0); 883#L153-1 ~mode3~0 := 0; 949#L150-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 986#L184 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 987#L187 assume !(node4_~m4~0#1 != ~nomsg~0); 899#L187-1 ~mode4~0 := 0; 979#L184-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 933#L218 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 935#L221 assume !(node5_~m5~0#1 != ~nomsg~0); 888#L221-1 ~mode5~0 := 0; 891#L218-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite13#1, node6_#t~ite14#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 892#L252 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 901#L255 assume !(node6_~m6~0#1 != ~nomsg~0); 903#L255-1 ~mode6~0 := 0; 905#L252-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; 1000#L458 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 878#L459 assume ~r1~0 < 6;check_~tmp~1#1 := 1; 879#L458-1 check_#res#1 := check_~tmp~1#1; 1001#L470 main_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret47#1;havoc main_#t~ret47#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; 941#L559 assume !(0 == assert_~arg#1 % 256); 942#L554 assume { :end_inline_assert } true;main_#t~post48#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post48#1;havoc main_#t~post48#1; 995#L526-2 [2021-12-15 17:22:54,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:54,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1766357374, now seen corresponding path program 2 times [2021-12-15 17:22:54,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:54,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777013858] [2021-12-15 17:22:54,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:54,494 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:54,506 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:54,524 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:54,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:54,525 INFO L85 PathProgramCache]: Analyzing trace with hash -704248189, now seen corresponding path program 1 times [2021-12-15 17:22:54,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:54,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830856753] [2021-12-15 17:22:54,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:54,526 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:54,532 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:54,542 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:54,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:54,543 INFO L85 PathProgramCache]: Analyzing trace with hash 170782690, now seen corresponding path program 1 times [2021-12-15 17:22:54,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:54,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582208829] [2021-12-15 17:22:54,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:54,543 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:54,579 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-15 17:22:54,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:54,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582208829] [2021-12-15 17:22:54,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582208829] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:54,580 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:54,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:22:54,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676855069] [2021-12-15 17:22:54,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:55,511 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.UnsupportedOperationException: Set is immutable at de.uni_freiburg.informatik.ultimate.util.datastructures.ImmutableSet.retainAll(ImmutableSet.java:338) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.removeSuperfluousVars(UnmodifiableTransFormula.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:273) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.getTrivialTransFormula(TransFormulaBuilder.java:285) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:548) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLoopTermination(LassoCheck.java:944) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:834) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-15 17:22:55,514 INFO L158 Benchmark]: Toolchain (without parser) took 2812.22ms. Allocated memory was 109.1MB in the beginning and 153.1MB in the end (delta: 44.0MB). Free memory was 82.4MB in the beginning and 116.0MB in the end (delta: -33.6MB). Peak memory consumption was 69.7MB. Max. memory is 16.1GB. [2021-12-15 17:22:55,515 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory was 54.4MB in the beginning and 54.4MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:22:55,515 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.63ms. Allocated memory is still 109.1MB. Free memory was 82.4MB in the beginning and 66.2MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-15 17:22:55,515 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.88ms. Allocated memory is still 109.1MB. Free memory was 66.2MB in the beginning and 63.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:22:55,516 INFO L158 Benchmark]: Boogie Preprocessor took 47.18ms. Allocated memory is still 109.1MB. Free memory was 63.3MB in the beginning and 61.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:22:55,516 INFO L158 Benchmark]: RCFGBuilder took 468.73ms. Allocated memory is still 109.1MB. Free memory was 61.2MB in the beginning and 37.2MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-12-15 17:22:55,516 INFO L158 Benchmark]: BuchiAutomizer took 1985.03ms. Allocated memory was 109.1MB in the beginning and 153.1MB in the end (delta: 44.0MB). Free memory was 36.8MB in the beginning and 116.0MB in the end (delta: -79.2MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2021-12-15 17:22:55,518 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory was 54.4MB in the beginning and 54.4MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.63ms. Allocated memory is still 109.1MB. Free memory was 82.4MB in the beginning and 66.2MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.88ms. Allocated memory is still 109.1MB. Free memory was 66.2MB in the beginning and 63.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.18ms. Allocated memory is still 109.1MB. Free memory was 63.3MB in the beginning and 61.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 468.73ms. Allocated memory is still 109.1MB. Free memory was 61.2MB in the beginning and 37.2MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * BuchiAutomizer took 1985.03ms. Allocated memory was 109.1MB in the beginning and 153.1MB in the end (delta: 44.0MB). Free memory was 36.8MB in the beginning and 116.0MB in the end (delta: -79.2MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: UnsupportedOperationException: Set is immutable de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: UnsupportedOperationException: Set is immutable: de.uni_freiburg.informatik.ultimate.util.datastructures.ImmutableSet.retainAll(ImmutableSet.java:338) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-15 17:22:55,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: Set is immutable