./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.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.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 a44e961521da9b8f4535724e185f402d94bec27d495ab6df10e2b3c1ffa4513a --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:22:53,306 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:22:53,337 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:22:53,371 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:22:53,372 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:22:53,374 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:22:53,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:22:53,377 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:22:53,379 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:22:53,382 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:22:53,382 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:22:53,383 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:22:53,383 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:22:53,385 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:22:53,386 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:22:53,389 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:22:53,389 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:22:53,390 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:22:53,391 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:22:53,395 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:22:53,396 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:22:53,397 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:22:53,398 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:22:53,399 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:22:53,403 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:22:53,404 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:22:53,404 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:22:53,405 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:22:53,405 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:22:53,406 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:22:53,406 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:22:53,407 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:22:53,408 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:22:53,409 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:22:53,410 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:22:53,410 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:22:53,410 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:22:53,410 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:22:53,411 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:22:53,411 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:22:53,412 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:22:53,413 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:53,438 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:22:53,438 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:22:53,438 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:22:53,439 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:22:53,439 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:22:53,440 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:22:53,440 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:22:53,440 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:22:53,440 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:22:53,440 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:22:53,441 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:22:53,441 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:22:53,441 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:22:53,441 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:22:53,441 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:22:53,441 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:22:53,442 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:22:53,442 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:22:53,442 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:22:53,442 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:22:53,442 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:22:53,442 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:22:53,442 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:22:53,442 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:22:53,443 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:22:53,443 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:22:53,443 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:22:53,443 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:22:53,443 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:22:53,443 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:22:53,443 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:22:53,444 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:22:53,444 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:22:53,444 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 -> a44e961521da9b8f4535724e185f402d94bec27d495ab6df10e2b3c1ffa4513a [2021-12-15 17:22:53,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:22:53,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:22:53,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:22:53,668 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:22:53,668 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:22:53,669 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.ufo.BOUNDED-12.pals.c [2021-12-15 17:22:53,712 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e4443860/3e6990b88c4f4ae7844202c2d410c2df/FLAGcda96ae89 [2021-12-15 17:22:54,108 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:22:54,110 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c [2021-12-15 17:22:54,123 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e4443860/3e6990b88c4f4ae7844202c2d410c2df/FLAGcda96ae89 [2021-12-15 17:22:54,473 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e4443860/3e6990b88c4f4ae7844202c2d410c2df [2021-12-15 17:22:54,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:22:54,477 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:22:54,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:22:54,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:22:54,482 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:22:54,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:22:54" (1/1) ... [2021-12-15 17:22:54,484 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@453737b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:54, skipping insertion in model container [2021-12-15 17:22:54,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:22:54" (1/1) ... [2021-12-15 17:22:54,488 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:22:54,550 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:22:54,770 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.ufo.BOUNDED-12.pals.c[16936,16949] [2021-12-15 17:22:54,771 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:22:54,783 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:22:54,838 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.ufo.BOUNDED-12.pals.c[16936,16949] [2021-12-15 17:22:54,838 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:22:54,849 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:22:54,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:54 WrapperNode [2021-12-15 17:22:54,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:22:54,850 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:22:54,850 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:22:54,850 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:22:54,856 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:54" (1/1) ... [2021-12-15 17:22:54,863 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:54" (1/1) ... [2021-12-15 17:22:54,883 INFO L137 Inliner]: procedures = 25, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 440 [2021-12-15 17:22:54,884 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:22:54,884 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:22:54,884 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:22:54,885 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:22:54,890 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:54" (1/1) ... [2021-12-15 17:22:54,891 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:54" (1/1) ... [2021-12-15 17:22:54,898 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:54" (1/1) ... [2021-12-15 17:22:54,899 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:54" (1/1) ... [2021-12-15 17:22:54,907 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:54" (1/1) ... [2021-12-15 17:22:54,911 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:54" (1/1) ... [2021-12-15 17:22:54,925 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:54" (1/1) ... [2021-12-15 17:22:54,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:22:54,928 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:22:54,928 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:22:54,929 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:22:54,929 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:54" (1/1) ... [2021-12-15 17:22:54,938 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:22:54,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:22:54,959 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:54,982 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:55,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:22:55,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:22:55,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:22:55,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:22:55,163 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:22:55,164 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:22:55,529 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:22:55,535 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:22:55,536 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 17:22:55,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:22:55 BoogieIcfgContainer [2021-12-15 17:22:55,537 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:22:55,538 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:22:55,538 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:22:55,540 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:22:55,541 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:55,541 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:22:54" (1/3) ... [2021-12-15 17:22:55,542 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b781f72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:22:55, skipping insertion in model container [2021-12-15 17:22:55,542 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:55,542 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:54" (2/3) ... [2021-12-15 17:22:55,542 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b781f72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:22:55, skipping insertion in model container [2021-12-15 17:22:55,543 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:55,543 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:22:55" (3/3) ... [2021-12-15 17:22:55,544 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c [2021-12-15 17:22:55,570 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:22:55,571 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:22:55,571 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:22:55,571 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:22:55,571 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:22:55,571 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:22:55,571 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:22:55,572 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:22:55,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 144 states, 143 states have (on average 1.7132867132867133) internal successors, (245), 143 states have internal predecessors, (245), 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:55,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2021-12-15 17:22:55,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:55,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:55,608 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:55,608 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:55,608 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:22:55,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 144 states, 143 states have (on average 1.7132867132867133) internal successors, (245), 143 states have internal predecessors, (245), 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:55,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2021-12-15 17:22:55,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:55,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:55,615 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:55,615 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:55,620 INFO L791 eck$LassoCheckResult]: Stem: 123#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(48, 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; 39#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#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~nondet16#1;havoc main_#t~nondet16#1;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 27#L288true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 65#L288-1true init_#res#1 := init_~tmp~0#1; 43#L453true main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#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; 97#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; 86#L529-2true [2021-12-15 17:22:55,621 INFO L793 eck$LassoCheckResult]: Loop: 86#L529-2true assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 120#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; 94#L88true assume !(node1_~m1~0#1 != ~nomsg~0); 116#L88-1true ~mode1~0 := 0; 26#L84-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 124#L119true assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 50#L122true assume !(node2_~m2~0#1 != ~nomsg~0); 42#L122-1true ~mode2~0 := 0; 45#L119-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 10#L153true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 134#L156true assume !(node3_~m3~0#1 != ~nomsg~0); 100#L156-1true ~mode3~0 := 0; 128#L153-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 126#L187true assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 61#L190true assume !(node4_~m4~0#1 != ~nomsg~0); 98#L190-1true ~mode4~0 := 0; 85#L187-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 89#L221true assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 78#L224true assume !(node5_~m5~0#1 != ~nomsg~0); 125#L224-1true ~mode5~0 := 0; 59#L221-2true assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 20#L255true assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 33#L258true assume !(node6_~m6~0#1 != ~nomsg~0); 13#L258-1true ~mode6~0 := 0; 133#L255-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; 5#L461true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 49#L461-1true check_#res#1 := check_~tmp~1#1; 131#L473true main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; 84#L562true assume !(0 == assert_~arg#1 % 256); 142#L557true assume { :end_inline_assert } true;main_#t~post49#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; 86#L529-2true [2021-12-15 17:22:55,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:55,625 INFO L85 PathProgramCache]: Analyzing trace with hash 2035845626, now seen corresponding path program 1 times [2021-12-15 17:22:55,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:55,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623866768] [2021-12-15 17:22:55,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:55,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:55,724 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:55,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:55,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623866768] [2021-12-15 17:22:55,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623866768] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:55,726 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:55,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 17:22:55,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761544576] [2021-12-15 17:22:55,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:55,730 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:22:55,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:55,731 INFO L85 PathProgramCache]: Analyzing trace with hash -373862285, now seen corresponding path program 1 times [2021-12-15 17:22:55,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:55,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851757758] [2021-12-15 17:22:55,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:55,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:55,855 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:55,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:55,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851757758] [2021-12-15 17:22:55,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851757758] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:55,856 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:55,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:55,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558612421] [2021-12-15 17:22:55,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:55,858 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:55,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:55,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 17:22:55,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 17:22:55,891 INFO L87 Difference]: Start difference. First operand has 144 states, 143 states have (on average 1.7132867132867133) internal successors, (245), 143 states have internal predecessors, (245), 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:55,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:55,905 INFO L93 Difference]: Finished difference Result 144 states and 242 transitions. [2021-12-15 17:22:55,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 17:22:55,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 242 transitions. [2021-12-15 17:22:55,916 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2021-12-15 17:22:55,921 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 139 states and 237 transitions. [2021-12-15 17:22:55,922 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2021-12-15 17:22:55,923 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2021-12-15 17:22:55,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 237 transitions. [2021-12-15 17:22:55,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:55,924 INFO L681 BuchiCegarLoop]: Abstraction has 139 states and 237 transitions. [2021-12-15 17:22:55,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 237 transitions. [2021-12-15 17:22:55,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2021-12-15 17:22:55,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 139 states have (on average 1.7050359712230216) internal successors, (237), 138 states have internal predecessors, (237), 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:55,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 237 transitions. [2021-12-15 17:22:55,949 INFO L704 BuchiCegarLoop]: Abstraction has 139 states and 237 transitions. [2021-12-15 17:22:55,950 INFO L587 BuchiCegarLoop]: Abstraction has 139 states and 237 transitions. [2021-12-15 17:22:55,950 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:22:55,950 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 237 transitions. [2021-12-15 17:22:55,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2021-12-15 17:22:55,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:55,952 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:55,953 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:55,953 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:55,953 INFO L791 eck$LassoCheckResult]: Stem: 435#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(48, 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; 365#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#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~nondet16#1;havoc main_#t~nondet16#1;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 349#L288 assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 306#L288-1 init_#res#1 := init_~tmp~0#1; 370#L453 main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#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; 366#L22 assume !(0 == assume_abort_if_not_~cond#1); 367#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; 420#L529-2 [2021-12-15 17:22:55,953 INFO L793 eck$LassoCheckResult]: Loop: 420#L529-2 assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 421#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; 425#L88 assume !(node1_~m1~0#1 != ~nomsg~0); 362#L88-1 ~mode1~0 := 0; 347#L84-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 348#L119 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 376#L122 assume !(node2_~m2~0#1 != ~nomsg~0); 340#L122-1 ~mode2~0 := 0; 330#L119-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 314#L153 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 315#L156 assume !(node3_~m3~0#1 != ~nomsg~0); 312#L156-1 ~mode3~0 := 0; 429#L153-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 436#L187 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 387#L190 assume !(node4_~m4~0#1 != ~nomsg~0); 388#L190-1 ~mode4~0 := 0; 418#L187-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 419#L221 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 410#L224 assume !(node5_~m5~0#1 != ~nomsg~0); 319#L224-1 ~mode5~0 := 0; 382#L221-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 331#L255 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 332#L258 assume !(node6_~m6~0#1 != ~nomsg~0); 322#L258-1 ~mode6~0 := 0; 323#L255-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; 301#L461 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 302#L461-1 check_#res#1 := check_~tmp~1#1; 375#L473 main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; 416#L562 assume !(0 == assert_~arg#1 % 256); 417#L557 assume { :end_inline_assert } true;main_#t~post49#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; 420#L529-2 [2021-12-15 17:22:55,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:55,954 INFO L85 PathProgramCache]: Analyzing trace with hash 2035845688, now seen corresponding path program 1 times [2021-12-15 17:22:55,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:55,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941680248] [2021-12-15 17:22:55,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:55,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:55,995 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:55,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:55,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941680248] [2021-12-15 17:22:56,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941680248] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:56,000 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:56,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:56,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066692977] [2021-12-15 17:22:56,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:56,001 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:22:56,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:56,002 INFO L85 PathProgramCache]: Analyzing trace with hash -373862285, now seen corresponding path program 2 times [2021-12-15 17:22:56,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:56,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258366798] [2021-12-15 17:22:56,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:56,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:56,077 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:56,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:56,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258366798] [2021-12-15 17:22:56,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258366798] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:56,078 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:56,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:56,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361649657] [2021-12-15 17:22:56,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:56,078 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:56,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:56,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:22:56,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:22:56,079 INFO L87 Difference]: Start difference. First operand 139 states and 237 transitions. cyclomatic complexity: 99 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:56,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:56,142 INFO L93 Difference]: Finished difference Result 142 states and 239 transitions. [2021-12-15 17:22:56,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:22:56,142 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 239 transitions. [2021-12-15 17:22:56,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2021-12-15 17:22:56,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 139 states and 196 transitions. [2021-12-15 17:22:56,145 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2021-12-15 17:22:56,145 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2021-12-15 17:22:56,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 196 transitions. [2021-12-15 17:22:56,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:56,146 INFO L681 BuchiCegarLoop]: Abstraction has 139 states and 196 transitions. [2021-12-15 17:22:56,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 196 transitions. [2021-12-15 17:22:56,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2021-12-15 17:22:56,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 139 states have (on average 1.410071942446043) internal successors, (196), 138 states have internal predecessors, (196), 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:56,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 196 transitions. [2021-12-15 17:22:56,151 INFO L704 BuchiCegarLoop]: Abstraction has 139 states and 196 transitions. [2021-12-15 17:22:56,151 INFO L587 BuchiCegarLoop]: Abstraction has 139 states and 196 transitions. [2021-12-15 17:22:56,151 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:22:56,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 196 transitions. [2021-12-15 17:22:56,155 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2021-12-15 17:22:56,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:56,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:56,157 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:56,157 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:56,157 INFO L791 eck$LassoCheckResult]: Stem: 731#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(48, 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; 660#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#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~nondet16#1;havoc main_#t~nondet16#1;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 645#L288 assume 0 == ~r1~0; 646#L289 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 655#L290 assume ~id1~0 >= 0; 704#L291 assume 0 == ~st1~0; 705#L292 assume ~send1~0 == ~id1~0; 720#L293 assume 0 == ~mode1~0 % 256; 730#L294 assume ~id2~0 >= 0; 604#L295 assume 0 == ~st2~0; 605#L296 assume ~send2~0 == ~id2~0; 654#L297 assume 0 == ~mode2~0 % 256; 651#L298 assume ~id3~0 >= 0; 652#L299 assume 0 == ~st3~0; 658#L300 assume ~send3~0 == ~id3~0; 693#L301 assume 0 == ~mode3~0 % 256; 716#L302 assume ~id4~0 >= 0; 717#L303 assume 0 == ~st4~0; 724#L304 assume ~send4~0 == ~id4~0; 686#L305 assume 0 == ~mode4~0 % 256; 687#L306 assume ~id5~0 >= 0; 703#L307 assume 0 == ~st5~0; 615#L308 assume ~send5~0 == ~id5~0; 616#L309 assume 0 == ~mode5~0 % 256; 700#L310 assume ~id6~0 >= 0; 672#L311 assume 0 == ~st6~0; 673#L312 assume ~send6~0 == ~id6~0; 637#L313 assume 0 == ~mode6~0 % 256; 638#L314 assume ~id1~0 != ~id2~0; 666#L315 assume ~id1~0 != ~id3~0; 667#L316 assume ~id1~0 != ~id4~0; 602#L317 assume ~id1~0 != ~id5~0; 603#L318 assume ~id1~0 != ~id6~0; 733#L319 assume ~id2~0 != ~id3~0; 713#L320 assume ~id2~0 != ~id4~0; 688#L321 assume ~id2~0 != ~id5~0; 689#L322 assume ~id2~0 != ~id6~0; 600#L323 assume ~id3~0 != ~id4~0; 601#L324 assume ~id3~0 != ~id5~0; 623#L325 assume ~id3~0 != ~id6~0; 647#L326 assume ~id4~0 != ~id5~0; 632#L327 assume ~id4~0 != ~id6~0; 633#L328 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 692#L288-1 init_#res#1 := init_~tmp~0#1; 665#L453 main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#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; 661#L22 assume !(0 == assume_abort_if_not_~cond#1); 662#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; 718#L529-2 [2021-12-15 17:22:56,157 INFO L793 eck$LassoCheckResult]: Loop: 718#L529-2 assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 719#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; 721#L88 assume !(node1_~m1~0#1 != ~nomsg~0); 657#L88-1 ~mode1~0 := 0; 642#L84-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 643#L119 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 671#L122 assume !(node2_~m2~0#1 != ~nomsg~0); 635#L122-1 ~mode2~0 := 0; 625#L119-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 609#L153 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 610#L156 assume !(node3_~m3~0#1 != ~nomsg~0); 607#L156-1 ~mode3~0 := 0; 725#L153-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 732#L187 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 682#L190 assume !(node4_~m4~0#1 != ~nomsg~0); 683#L190-1 ~mode4~0 := 0; 714#L187-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 715#L221 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 706#L224 assume !(node5_~m5~0#1 != ~nomsg~0); 614#L224-1 ~mode5~0 := 0; 680#L221-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 626#L255 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 627#L258 assume !(node6_~m6~0#1 != ~nomsg~0); 617#L258-1 ~mode6~0 := 0; 618#L255-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; 597#L461 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 598#L461-1 check_#res#1 := check_~tmp~1#1; 670#L473 main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; 711#L562 assume !(0 == assert_~arg#1 % 256); 712#L557 assume { :end_inline_assert } true;main_#t~post49#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; 718#L529-2 [2021-12-15 17:22:56,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:56,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1766357374, now seen corresponding path program 1 times [2021-12-15 17:22:56,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:56,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124543197] [2021-12-15 17:22:56,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:56,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:56,178 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:56,221 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:56,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:56,222 INFO L85 PathProgramCache]: Analyzing trace with hash -373862285, now seen corresponding path program 3 times [2021-12-15 17:22:56,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:56,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481265638] [2021-12-15 17:22:56,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:56,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:56,275 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:56,275 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:56,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481265638] [2021-12-15 17:22:56,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481265638] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:56,275 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:56,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:56,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698447249] [2021-12-15 17:22:56,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:56,276 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:56,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:56,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:22:56,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:22:56,277 INFO L87 Difference]: Start difference. First operand 139 states and 196 transitions. cyclomatic complexity: 58 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:56,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:56,305 INFO L93 Difference]: Finished difference Result 142 states and 198 transitions. [2021-12-15 17:22:56,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:22:56,306 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 198 transitions. [2021-12-15 17:22:56,307 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2021-12-15 17:22:56,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 139 states and 194 transitions. [2021-12-15 17:22:56,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2021-12-15 17:22:56,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2021-12-15 17:22:56,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 194 transitions. [2021-12-15 17:22:56,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:56,309 INFO L681 BuchiCegarLoop]: Abstraction has 139 states and 194 transitions. [2021-12-15 17:22:56,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 194 transitions. [2021-12-15 17:22:56,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2021-12-15 17:22:56,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 139 states have (on average 1.39568345323741) internal successors, (194), 138 states have internal predecessors, (194), 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:56,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 194 transitions. [2021-12-15 17:22:56,314 INFO L704 BuchiCegarLoop]: Abstraction has 139 states and 194 transitions. [2021-12-15 17:22:56,314 INFO L587 BuchiCegarLoop]: Abstraction has 139 states and 194 transitions. [2021-12-15 17:22:56,314 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:22:56,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 194 transitions. [2021-12-15 17:22:56,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2021-12-15 17:22:56,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:56,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:56,316 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:56,316 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:56,316 INFO L791 eck$LassoCheckResult]: Stem: 1024#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(48, 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; 952#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#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~nondet16#1;havoc main_#t~nondet16#1;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 937#L288 assume 0 == ~r1~0; 938#L289 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 947#L290 assume ~id1~0 >= 0; 997#L291 assume 0 == ~st1~0; 998#L292 assume ~send1~0 == ~id1~0; 1013#L293 assume 0 == ~mode1~0 % 256; 1023#L294 assume ~id2~0 >= 0; 896#L295 assume 0 == ~st2~0; 897#L296 assume ~send2~0 == ~id2~0; 946#L297 assume 0 == ~mode2~0 % 256; 943#L298 assume ~id3~0 >= 0; 944#L299 assume 0 == ~st3~0; 950#L300 assume ~send3~0 == ~id3~0; 986#L301 assume 0 == ~mode3~0 % 256; 1011#L302 assume ~id4~0 >= 0; 1012#L303 assume 0 == ~st4~0; 1017#L304 assume ~send4~0 == ~id4~0; 979#L305 assume 0 == ~mode4~0 % 256; 980#L306 assume ~id5~0 >= 0; 996#L307 assume 0 == ~st5~0; 907#L308 assume ~send5~0 == ~id5~0; 908#L309 assume 0 == ~mode5~0 % 256; 993#L310 assume ~id6~0 >= 0; 965#L311 assume 0 == ~st6~0; 966#L312 assume ~send6~0 == ~id6~0; 929#L313 assume 0 == ~mode6~0 % 256; 930#L314 assume ~id1~0 != ~id2~0; 958#L315 assume ~id1~0 != ~id3~0; 959#L316 assume ~id1~0 != ~id4~0; 894#L317 assume ~id1~0 != ~id5~0; 895#L318 assume ~id1~0 != ~id6~0; 1026#L319 assume ~id2~0 != ~id3~0; 1004#L320 assume ~id2~0 != ~id4~0; 981#L321 assume ~id2~0 != ~id5~0; 982#L322 assume ~id2~0 != ~id6~0; 892#L323 assume ~id3~0 != ~id4~0; 893#L324 assume ~id3~0 != ~id5~0; 912#L325 assume ~id3~0 != ~id6~0; 939#L326 assume ~id4~0 != ~id5~0; 924#L327 assume ~id4~0 != ~id6~0; 925#L328 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 983#L288-1 init_#res#1 := init_~tmp~0#1; 955#L453 main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#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; 953#L22 assume !(0 == assume_abort_if_not_~cond#1); 954#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; 1009#L529-2 [2021-12-15 17:22:56,316 INFO L793 eck$LassoCheckResult]: Loop: 1009#L529-2 assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 1010#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; 1014#L88 assume !(node1_~m1~0#1 != ~nomsg~0); 949#L88-1 ~mode1~0 := 0; 934#L84-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 935#L119 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 964#L122 assume !(node2_~m2~0#1 != ~nomsg~0); 927#L122-1 ~mode2~0 := 0; 917#L119-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 901#L153 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 902#L156 assume !(node3_~m3~0#1 != ~nomsg~0); 899#L156-1 ~mode3~0 := 0; 1018#L153-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 1025#L187 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 975#L190 assume !(node4_~m4~0#1 != ~nomsg~0); 976#L190-1 ~mode4~0 := 0; 1007#L187-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 1008#L221 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 999#L224 assume !(node5_~m5~0#1 != ~nomsg~0); 906#L224-1 ~mode5~0 := 0; 973#L221-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 918#L255 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 919#L258 assume !(node6_~m6~0#1 != ~nomsg~0); 909#L258-1 ~mode6~0 := 0; 910#L255-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; 890#L461 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 891#L462 assume ~r1~0 < 6;check_~tmp~1#1 := 1; 962#L461-1 check_#res#1 := check_~tmp~1#1; 963#L473 main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; 1005#L562 assume !(0 == assert_~arg#1 % 256); 1006#L557 assume { :end_inline_assert } true;main_#t~post49#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; 1009#L529-2 [2021-12-15 17:22:56,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:56,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1766357374, now seen corresponding path program 2 times [2021-12-15 17:22:56,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:56,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074104620] [2021-12-15 17:22:56,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:56,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:56,344 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:56,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:56,366 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:56,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:56,367 INFO L85 PathProgramCache]: Analyzing trace with hash 911844111, now seen corresponding path program 1 times [2021-12-15 17:22:56,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:56,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004729883] [2021-12-15 17:22:56,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:56,367 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:56,375 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:56,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:56,386 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:56,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:56,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1786874990, now seen corresponding path program 1 times [2021-12-15 17:22:56,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:56,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828387353] [2021-12-15 17:22:56,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:56,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:56,457 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:56,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:56,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828387353] [2021-12-15 17:22:56,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828387353] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:56,458 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:56,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:22:56,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081191781] [2021-12-15 17:22:56,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:57,305 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:57,309 INFO L158 Benchmark]: Toolchain (without parser) took 2830.73ms. Allocated memory was 94.4MB in the beginning and 151.0MB in the end (delta: 56.6MB). Free memory was 56.4MB in the beginning and 80.0MB in the end (delta: -23.6MB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. [2021-12-15 17:22:57,309 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 94.4MB. Free memory is still 73.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:22:57,309 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.80ms. Allocated memory is still 94.4MB. Free memory was 56.2MB in the beginning and 62.7MB in the end (delta: -6.5MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2021-12-15 17:22:57,309 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.64ms. Allocated memory is still 94.4MB. Free memory was 62.5MB in the beginning and 59.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:22:57,310 INFO L158 Benchmark]: Boogie Preprocessor took 43.56ms. Allocated memory is still 94.4MB. Free memory was 59.8MB in the beginning and 57.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:22:57,310 INFO L158 Benchmark]: RCFGBuilder took 609.15ms. Allocated memory was 94.4MB in the beginning and 125.8MB in the end (delta: 31.5MB). Free memory was 57.3MB in the beginning and 85.8MB in the end (delta: -28.5MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2021-12-15 17:22:57,311 INFO L158 Benchmark]: BuchiAutomizer took 1769.30ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 85.8MB in the beginning and 80.0MB in the end (delta: 5.8MB). Peak memory consumption was 45.4MB. Max. memory is 16.1GB. [2021-12-15 17:22:57,313 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 94.4MB. Free memory is still 73.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.80ms. Allocated memory is still 94.4MB. Free memory was 56.2MB in the beginning and 62.7MB in the end (delta: -6.5MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.64ms. Allocated memory is still 94.4MB. Free memory was 62.5MB in the beginning and 59.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.56ms. Allocated memory is still 94.4MB. Free memory was 59.8MB in the beginning and 57.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 609.15ms. Allocated memory was 94.4MB in the beginning and 125.8MB in the end (delta: 31.5MB). Free memory was 57.3MB in the beginning and 85.8MB in the end (delta: -28.5MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 1769.30ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 85.8MB in the beginning and 80.0MB in the end (delta: 5.8MB). Peak memory consumption was 45.4MB. 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:57,348 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