./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.6.ufo.UNBOUNDED.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.6.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 71881827e42af7e93d8d7789f21cf70c42c80b5b7128690239afcf02ba9daf37 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:23:03,647 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:23:03,660 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:23:03,700 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:23:03,702 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:23:03,705 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:23:03,707 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:23:03,711 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:23:03,713 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:23:03,714 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:23:03,714 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:23:03,716 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:23:03,717 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:23:03,720 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:23:03,722 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:23:03,724 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:23:03,725 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:23:03,727 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:23:03,729 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:23:03,731 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:23:03,735 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:23:03,736 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:23:03,737 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:23:03,738 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:23:03,743 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:23:03,745 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:23:03,745 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:23:03,746 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:23:03,747 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:23:03,748 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:23:03,748 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:23:03,749 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:23:03,750 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:23:03,751 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:23:03,752 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:23:03,752 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:23:03,753 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:23:03,753 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:23:03,753 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:23:03,754 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:23:03,754 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:23:03,756 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:23:03,784 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:23:03,785 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:23:03,785 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:23:03,785 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:23:03,786 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:23:03,786 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:23:03,786 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:23:03,786 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:23:03,787 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:23:03,787 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:23:03,787 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:23:03,787 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:23:03,787 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:23:03,787 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:23:03,787 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:23:03,788 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:23:03,788 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:23:03,788 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:23:03,788 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:23:03,788 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:23:03,788 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:23:03,788 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:23:03,789 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:23:03,789 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:23:03,789 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:23:03,789 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:23:03,789 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:23:03,789 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:23:03,790 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:23:03,790 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:23:03,790 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:23:03,790 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:23:03,791 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:23:03,791 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 -> 71881827e42af7e93d8d7789f21cf70c42c80b5b7128690239afcf02ba9daf37 [2021-12-15 17:23:03,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:23:03,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:23:03,959 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:23:03,959 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:23:03,960 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:23:03,960 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.6.ufo.UNBOUNDED.pals.c [2021-12-15 17:23:04,015 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76f183082/fc8e250f3a7343118718ff08ecca8423/FLAG8898bf45e [2021-12-15 17:23:04,384 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:23:04,385 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.6.ufo.UNBOUNDED.pals.c [2021-12-15 17:23:04,393 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76f183082/fc8e250f3a7343118718ff08ecca8423/FLAG8898bf45e [2021-12-15 17:23:04,806 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76f183082/fc8e250f3a7343118718ff08ecca8423 [2021-12-15 17:23:04,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:23:04,809 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:23:04,811 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:23:04,811 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:23:04,813 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:23:04,814 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:23:04" (1/1) ... [2021-12-15 17:23:04,814 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aacba5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:04, skipping insertion in model container [2021-12-15 17:23:04,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:23:04" (1/1) ... [2021-12-15 17:23:04,819 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:23:04,849 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:23:05,008 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.6.ufo.UNBOUNDED.pals.c[15103,15116] [2021-12-15 17:23:05,008 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:23:05,014 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:23:05,063 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.6.ufo.UNBOUNDED.pals.c[15103,15116] [2021-12-15 17:23:05,064 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:23:05,073 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:23:05,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:05 WrapperNode [2021-12-15 17:23:05,073 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:23:05,074 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:23:05,074 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:23:05,074 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:23:05,079 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:23:05" (1/1) ... [2021-12-15 17:23:05,093 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:23:05" (1/1) ... [2021-12-15 17:23:05,116 INFO L137 Inliner]: procedures = 26, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 370 [2021-12-15 17:23:05,117 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:23:05,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:23:05,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:23:05,117 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:23:05,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:05" (1/1) ... [2021-12-15 17:23:05,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:05" (1/1) ... [2021-12-15 17:23:05,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:05" (1/1) ... [2021-12-15 17:23:05,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:05" (1/1) ... [2021-12-15 17:23:05,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:05" (1/1) ... [2021-12-15 17:23:05,136 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:05" (1/1) ... [2021-12-15 17:23:05,138 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:05" (1/1) ... [2021-12-15 17:23:05,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:23:05,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:23:05,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:23:05,141 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:23:05,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:05" (1/1) ... [2021-12-15 17:23:05,148 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:23:05,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:23:05,175 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:23:05,187 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:23:05,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:23:05,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:23:05,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:23:05,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:23:05,269 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:23:05,270 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:23:05,526 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:23:05,531 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:23:05,531 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 17:23:05,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:23:05 BoogieIcfgContainer [2021-12-15 17:23:05,533 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:23:05,543 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:23:05,544 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:23:05,546 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:23:05,547 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:23:05,547 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:23:04" (1/3) ... [2021-12-15 17:23:05,547 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25ab75ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:23:05, skipping insertion in model container [2021-12-15 17:23:05,548 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:23:05,548 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:05" (2/3) ... [2021-12-15 17:23:05,548 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25ab75ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:23:05, skipping insertion in model container [2021-12-15 17:23:05,548 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:23:05,548 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:23:05" (3/3) ... [2021-12-15 17:23:05,549 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals.c [2021-12-15 17:23:05,576 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:23:05,577 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:23:05,577 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:23:05,577 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:23:05,577 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:23:05,577 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:23:05,577 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:23:05,577 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:23:05,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 111 states, 110 states have (on average 1.7272727272727273) internal successors, (190), 110 states have internal predecessors, (190), 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:23:05,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2021-12-15 17:23:05,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:05,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:05,632 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:23:05,633 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:23:05,633 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:23:05,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 111 states, 110 states have (on average 1.7272727272727273) internal successors, (190), 110 states have internal predecessors, (190), 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:23:05,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2021-12-15 17:23:05,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:05,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:05,644 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:23:05,644 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:23:05,649 INFO L791 eck$LassoCheckResult]: Stem: 101#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(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; 37#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 78#L231true assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; 41#L231-1true init_#res#1 := init_~tmp~0#1; 43#L392true main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 39#L22true assume !(0 == assume_abort_if_not_~cond#1); 89#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; 33#L470-2true [2021-12-15 17:23:05,655 INFO L793 eck$LassoCheckResult]: Loop: 33#L470-2true assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 20#L78true assume !(0 != ~mode1~0 % 256); 86#L95true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 91#L95-2true ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 40#L78-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 107#L107true assume !(0 != ~mode2~0 % 256); 42#L120true assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 30#L120-2true ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 63#L107-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 108#L132true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 95#L135true assume !(node3_~m3~0#1 != ~nomsg~0); 13#L135-1true ~mode3~0 := 0; 81#L132-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 6#L157true assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 88#L160true assume !(node4_~m4~0#1 != ~nomsg~0); 32#L160-1true ~mode4~0 := 0; 44#L157-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 92#L182true assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 90#L185true assume !(node5_~m5~0#1 != ~nomsg~0); 99#L185-1true ~mode5~0 := 0; 18#L182-2true assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 73#L207true assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 9#L210true assume !(node6_~m6~0#1 != ~nomsg~0); 28#L210-1true ~mode6~0 := 0; 85#L207-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; 75#L400true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 69#L400-1true check_#res#1 := check_~tmp~1#1; 36#L420true main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 38#L502true assume !(0 == assert_~arg#1 % 256); 103#L497true assume { :end_inline_assert } true; 33#L470-2true [2021-12-15 17:23:05,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:05,665 INFO L85 PathProgramCache]: Analyzing trace with hash 2030119858, now seen corresponding path program 1 times [2021-12-15 17:23:05,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:05,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112560768] [2021-12-15 17:23:05,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:05,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:05,852 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:23:05,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:05,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112560768] [2021-12-15 17:23:05,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112560768] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:05,853 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:05,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:23:05,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753350221] [2021-12-15 17:23:05,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:05,860 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:23:05,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:05,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1342568590, now seen corresponding path program 1 times [2021-12-15 17:23:05,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:05,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731636898] [2021-12-15 17:23:05,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:05,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:05,979 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:23:05,980 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:05,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731636898] [2021-12-15 17:23:05,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731636898] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:05,981 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:05,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:23:05,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377004826] [2021-12-15 17:23:05,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:05,982 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:23:05,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:23:06,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:23:06,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:23:06,008 INFO L87 Difference]: Start difference. First operand has 111 states, 110 states have (on average 1.7272727272727273) internal successors, (190), 110 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:23:06,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:23:06,101 INFO L93 Difference]: Finished difference Result 110 states and 185 transitions. [2021-12-15 17:23:06,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:23:06,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 110 states and 185 transitions. [2021-12-15 17:23:06,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 60 [2021-12-15 17:23:06,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 110 states to 106 states and 142 transitions. [2021-12-15 17:23:06,111 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 106 [2021-12-15 17:23:06,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 [2021-12-15 17:23:06,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 142 transitions. [2021-12-15 17:23:06,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:23:06,113 INFO L681 BuchiCegarLoop]: Abstraction has 106 states and 142 transitions. [2021-12-15 17:23:06,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 142 transitions. [2021-12-15 17:23:06,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2021-12-15 17:23:06,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 106 states have (on average 1.3396226415094339) internal successors, (142), 105 states have internal predecessors, (142), 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:23:06,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 142 transitions. [2021-12-15 17:23:06,147 INFO L704 BuchiCegarLoop]: Abstraction has 106 states and 142 transitions. [2021-12-15 17:23:06,147 INFO L587 BuchiCegarLoop]: Abstraction has 106 states and 142 transitions. [2021-12-15 17:23:06,147 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:23:06,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 142 transitions. [2021-12-15 17:23:06,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 60 [2021-12-15 17:23:06,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:06,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:06,150 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:23:06,150 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:23:06,151 INFO L791 eck$LassoCheckResult]: Stem: 344#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(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; 295#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 296#L231 assume 0 == ~r1~0 % 256; 335#L232 assume ~id1~0 >= 0; 324#L233 assume 0 == ~st1~0; 325#L234 assume ~send1~0 == ~id1~0; 331#L235 assume 0 == ~mode1~0 % 256; 315#L236 assume ~id2~0 >= 0; 316#L237 assume 0 == ~st2~0; 281#L238 assume ~send2~0 == ~id2~0; 282#L239 assume 0 == ~mode2~0 % 256; 279#L240 assume ~id3~0 >= 0; 280#L241 assume 0 == ~st3~0; 284#L242 assume ~send3~0 == ~id3~0; 334#L243 assume 0 == ~mode3~0 % 256; 247#L244 assume ~id4~0 >= 0; 248#L245 assume 0 == ~st4~0; 283#L246 assume ~send4~0 == ~id4~0; 319#L247 assume 0 == ~mode4~0 % 256; 343#L248 assume ~id5~0 >= 0; 242#L249 assume 0 == ~st5~0; 243#L250 assume ~send5~0 == ~id5~0; 337#L251 assume 0 == ~mode5~0 % 256; 307#L252 assume ~id6~0 >= 0; 308#L253 assume 0 == ~st6~0; 311#L254 assume ~send6~0 == ~id6~0; 266#L255 assume 0 == ~mode6~0 % 256; 267#L256 assume ~id1~0 != ~id2~0; 309#L257 assume ~id1~0 != ~id3~0; 287#L258 assume ~id1~0 != ~id4~0; 288#L259 assume ~id1~0 != ~id5~0; 326#L260 assume ~id1~0 != ~id6~0; 327#L261 assume ~id2~0 != ~id3~0; 312#L262 assume ~id2~0 != ~id4~0; 313#L263 assume ~id2~0 != ~id5~0; 317#L264 assume ~id2~0 != ~id6~0; 318#L265 assume ~id3~0 != ~id4~0; 257#L266 assume ~id3~0 != ~id5~0; 258#L267 assume ~id3~0 != ~id6~0; 272#L268 assume ~id4~0 != ~id5~0; 273#L269 assume ~id4~0 != ~id6~0; 252#L270 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 253#L231-1 init_#res#1 := init_~tmp~0#1; 302#L392 main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 298#L22 assume !(0 == assume_abort_if_not_~cond#1); 299#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; 290#L470-2 [2021-12-15 17:23:06,151 INFO L793 eck$LassoCheckResult]: Loop: 290#L470-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 276#L78 assume !(0 != ~mode1~0 % 256); 277#L95 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 338#L95-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 300#L78-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 301#L107 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 329#L110 assume !(node2_~m2~0#1 != ~nomsg~0); 268#L110-1 ~mode2~0 := 0; 269#L107-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 328#L132 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 342#L135 assume !(node3_~m3~0#1 != ~nomsg~0); 262#L135-1 ~mode3~0 := 0; 263#L132-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 244#L157 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 245#L160 assume !(node4_~m4~0#1 != ~nomsg~0); 260#L160-1 ~mode4~0 := 0; 289#L157-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 304#L182 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 339#L185 assume !(node5_~m5~0#1 != ~nomsg~0); 321#L185-1 ~mode5~0 := 0; 274#L182-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 275#L207 assume !(0 != ~mode6~0 % 256); 323#L220 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 306#L220-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 285#L207-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; 333#L400 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 330#L400-1 check_#res#1 := check_~tmp~1#1; 293#L420 main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 294#L502 assume !(0 == assert_~arg#1 % 256); 297#L497 assume { :end_inline_assert } true; 290#L470-2 [2021-12-15 17:23:06,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:06,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1716035805, now seen corresponding path program 1 times [2021-12-15 17:23:06,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:06,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531972894] [2021-12-15 17:23:06,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:06,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:06,173 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:23:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:06,224 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:23:06,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:06,226 INFO L85 PathProgramCache]: Analyzing trace with hash 620999538, now seen corresponding path program 1 times [2021-12-15 17:23:06,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:06,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80186972] [2021-12-15 17:23:06,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:06,227 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:06,311 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:23:06,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:06,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80186972] [2021-12-15 17:23:06,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80186972] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:06,312 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:06,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:23:06,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495079129] [2021-12-15 17:23:06,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:06,313 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:23:06,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:23:06,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:23:06,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:23:06,314 INFO L87 Difference]: Start difference. First operand 106 states and 142 transitions. cyclomatic complexity: 37 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:23:06,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:23:06,350 INFO L93 Difference]: Finished difference Result 109 states and 144 transitions. [2021-12-15 17:23:06,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:23:06,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 144 transitions. [2021-12-15 17:23:06,353 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 60 [2021-12-15 17:23:06,355 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 106 states and 139 transitions. [2021-12-15 17:23:06,356 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 106 [2021-12-15 17:23:06,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 [2021-12-15 17:23:06,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 139 transitions. [2021-12-15 17:23:06,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:23:06,359 INFO L681 BuchiCegarLoop]: Abstraction has 106 states and 139 transitions. [2021-12-15 17:23:06,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 139 transitions. [2021-12-15 17:23:06,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2021-12-15 17:23:06,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 106 states have (on average 1.3113207547169812) internal successors, (139), 105 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:23:06,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 139 transitions. [2021-12-15 17:23:06,363 INFO L704 BuchiCegarLoop]: Abstraction has 106 states and 139 transitions. [2021-12-15 17:23:06,363 INFO L587 BuchiCegarLoop]: Abstraction has 106 states and 139 transitions. [2021-12-15 17:23:06,363 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:23:06,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 139 transitions. [2021-12-15 17:23:06,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 60 [2021-12-15 17:23:06,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:06,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:06,365 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:23:06,366 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:23:06,367 INFO L791 eck$LassoCheckResult]: Stem: 571#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(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; 522#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 523#L231 assume 0 == ~r1~0 % 256; 562#L232 assume ~id1~0 >= 0; 551#L233 assume 0 == ~st1~0; 552#L234 assume ~send1~0 == ~id1~0; 558#L235 assume 0 == ~mode1~0 % 256; 542#L236 assume ~id2~0 >= 0; 543#L237 assume 0 == ~st2~0; 508#L238 assume ~send2~0 == ~id2~0; 509#L239 assume 0 == ~mode2~0 % 256; 506#L240 assume ~id3~0 >= 0; 507#L241 assume 0 == ~st3~0; 511#L242 assume ~send3~0 == ~id3~0; 561#L243 assume 0 == ~mode3~0 % 256; 474#L244 assume ~id4~0 >= 0; 475#L245 assume 0 == ~st4~0; 510#L246 assume ~send4~0 == ~id4~0; 546#L247 assume 0 == ~mode4~0 % 256; 570#L248 assume ~id5~0 >= 0; 469#L249 assume 0 == ~st5~0; 470#L250 assume ~send5~0 == ~id5~0; 564#L251 assume 0 == ~mode5~0 % 256; 534#L252 assume ~id6~0 >= 0; 535#L253 assume 0 == ~st6~0; 538#L254 assume ~send6~0 == ~id6~0; 493#L255 assume 0 == ~mode6~0 % 256; 494#L256 assume ~id1~0 != ~id2~0; 536#L257 assume ~id1~0 != ~id3~0; 514#L258 assume ~id1~0 != ~id4~0; 515#L259 assume ~id1~0 != ~id5~0; 553#L260 assume ~id1~0 != ~id6~0; 554#L261 assume ~id2~0 != ~id3~0; 539#L262 assume ~id2~0 != ~id4~0; 540#L263 assume ~id2~0 != ~id5~0; 544#L264 assume ~id2~0 != ~id6~0; 545#L265 assume ~id3~0 != ~id4~0; 484#L266 assume ~id3~0 != ~id5~0; 485#L267 assume ~id3~0 != ~id6~0; 499#L268 assume ~id4~0 != ~id5~0; 500#L269 assume ~id4~0 != ~id6~0; 479#L270 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 480#L231-1 init_#res#1 := init_~tmp~0#1; 529#L392 main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 525#L22 assume !(0 == assume_abort_if_not_~cond#1); 526#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; 517#L470-2 [2021-12-15 17:23:06,367 INFO L793 eck$LassoCheckResult]: Loop: 517#L470-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 503#L78 assume !(0 != ~mode1~0 % 256); 504#L95 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 565#L95-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 527#L78-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 528#L107 assume !(0 != ~mode2~0 % 256); 530#L120 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 513#L120-2 ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 496#L107-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 555#L132 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 569#L135 assume !(node3_~m3~0#1 != ~nomsg~0); 489#L135-1 ~mode3~0 := 0; 490#L132-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 471#L157 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 472#L160 assume !(node4_~m4~0#1 != ~nomsg~0); 487#L160-1 ~mode4~0 := 0; 516#L157-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 531#L182 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 566#L185 assume !(node5_~m5~0#1 != ~nomsg~0); 548#L185-1 ~mode5~0 := 0; 501#L182-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 502#L207 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 481#L210 assume !(node6_~m6~0#1 != ~nomsg~0); 482#L210-1 ~mode6~0 := 0; 512#L207-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; 560#L400 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 476#L401 assume ~r1~0 % 256 >= 6; 477#L405 assume ~r1~0 % 256 < 6;check_~tmp~1#1 := 1; 557#L400-1 check_#res#1 := check_~tmp~1#1; 520#L420 main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 521#L502 assume !(0 == assert_~arg#1 % 256); 524#L497 assume { :end_inline_assert } true; 517#L470-2 [2021-12-15 17:23:06,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:06,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1716035805, now seen corresponding path program 2 times [2021-12-15 17:23:06,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:06,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543121909] [2021-12-15 17:23:06,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:06,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:06,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:06,388 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:23:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:06,413 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:23:06,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:06,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1160925474, now seen corresponding path program 1 times [2021-12-15 17:23:06,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:06,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355822149] [2021-12-15 17:23:06,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:06,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:06,438 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:23:06,439 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:06,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355822149] [2021-12-15 17:23:06,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355822149] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:06,439 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:06,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:23:06,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244666388] [2021-12-15 17:23:06,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:06,440 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:23:06,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:23:06,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:23:06,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:23:06,440 INFO L87 Difference]: Start difference. First operand 106 states and 139 transitions. cyclomatic complexity: 34 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:23:06,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:23:06,461 INFO L93 Difference]: Finished difference Result 160 states and 221 transitions. [2021-12-15 17:23:06,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:23:06,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 221 transitions. [2021-12-15 17:23:06,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 114 [2021-12-15 17:23:06,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 160 states and 221 transitions. [2021-12-15 17:23:06,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 160 [2021-12-15 17:23:06,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160 [2021-12-15 17:23:06,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 160 states and 221 transitions. [2021-12-15 17:23:06,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:23:06,470 INFO L681 BuchiCegarLoop]: Abstraction has 160 states and 221 transitions. [2021-12-15 17:23:06,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states and 221 transitions. [2021-12-15 17:23:06,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2021-12-15 17:23:06,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 158 states have (on average 1.379746835443038) internal successors, (218), 157 states have internal predecessors, (218), 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:23:06,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 218 transitions. [2021-12-15 17:23:06,484 INFO L704 BuchiCegarLoop]: Abstraction has 158 states and 218 transitions. [2021-12-15 17:23:06,484 INFO L587 BuchiCegarLoop]: Abstraction has 158 states and 218 transitions. [2021-12-15 17:23:06,484 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:23:06,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 158 states and 218 transitions. [2021-12-15 17:23:06,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 112 [2021-12-15 17:23:06,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:06,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:06,487 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:23:06,487 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:23:06,487 INFO L791 eck$LassoCheckResult]: Stem: 850#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(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; 795#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 796#L231 assume 0 == ~r1~0 % 256; 837#L232 assume ~id1~0 >= 0; 825#L233 assume 0 == ~st1~0; 826#L234 assume ~send1~0 == ~id1~0; 832#L235 assume 0 == ~mode1~0 % 256; 815#L236 assume ~id2~0 >= 0; 816#L237 assume 0 == ~st2~0; 779#L238 assume ~send2~0 == ~id2~0; 780#L239 assume 0 == ~mode2~0 % 256; 777#L240 assume ~id3~0 >= 0; 778#L241 assume 0 == ~st3~0; 782#L242 assume ~send3~0 == ~id3~0; 836#L243 assume 0 == ~mode3~0 % 256; 746#L244 assume ~id4~0 >= 0; 747#L245 assume 0 == ~st4~0; 781#L246 assume ~send4~0 == ~id4~0; 819#L247 assume 0 == ~mode4~0 % 256; 847#L248 assume ~id5~0 >= 0; 741#L249 assume 0 == ~st5~0; 742#L250 assume ~send5~0 == ~id5~0; 839#L251 assume 0 == ~mode5~0 % 256; 807#L252 assume ~id6~0 >= 0; 808#L253 assume 0 == ~st6~0; 811#L254 assume ~send6~0 == ~id6~0; 764#L255 assume 0 == ~mode6~0 % 256; 765#L256 assume ~id1~0 != ~id2~0; 809#L257 assume ~id1~0 != ~id3~0; 786#L258 assume ~id1~0 != ~id4~0; 787#L259 assume ~id1~0 != ~id5~0; 827#L260 assume ~id1~0 != ~id6~0; 828#L261 assume ~id2~0 != ~id3~0; 812#L262 assume ~id2~0 != ~id4~0; 813#L263 assume ~id2~0 != ~id5~0; 817#L264 assume ~id2~0 != ~id6~0; 818#L265 assume ~id3~0 != ~id4~0; 755#L266 assume ~id3~0 != ~id5~0; 756#L267 assume ~id3~0 != ~id6~0; 770#L268 assume ~id4~0 != ~id5~0; 771#L269 assume ~id4~0 != ~id6~0; 750#L270 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 751#L231-1 init_#res#1 := init_~tmp~0#1; 802#L392 main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 798#L22 assume !(0 == assume_abort_if_not_~cond#1); 799#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; 790#L470-2 [2021-12-15 17:23:06,487 INFO L793 eck$LassoCheckResult]: Loop: 790#L470-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 774#L78 assume !(0 != ~mode1~0 % 256); 775#L95 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 841#L95-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 800#L78-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 801#L107 assume !(0 != ~mode2~0 % 256); 803#L120 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 785#L120-2 ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 767#L107-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 829#L132 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 846#L135 assume !(node3_~m3~0#1 != ~nomsg~0); 760#L135-1 ~mode3~0 := 0; 761#L132-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 743#L157 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 744#L160 assume !(node4_~m4~0#1 != ~nomsg~0); 788#L160-1 ~mode4~0 := 0; 789#L157-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 804#L182 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 843#L185 assume !(node5_~m5~0#1 != ~nomsg~0); 821#L185-1 ~mode5~0 := 0; 834#L182-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 855#L207 assume !(0 != ~mode6~0 % 256); 854#L220 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 806#L220-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 784#L207-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; 853#L400 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 852#L401 assume !(~r1~0 % 256 >= 6); 848#L404 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; 849#L405 assume ~r1~0 % 256 < 6;check_~tmp~1#1 := 1; 831#L400-1 check_#res#1 := check_~tmp~1#1; 793#L420 main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 794#L502 assume !(0 == assert_~arg#1 % 256); 797#L497 assume { :end_inline_assert } true; 790#L470-2 [2021-12-15 17:23:06,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:06,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1716035805, now seen corresponding path program 3 times [2021-12-15 17:23:06,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:06,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044559767] [2021-12-15 17:23:06,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:06,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:06,506 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:23:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:06,532 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:23:06,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:06,532 INFO L85 PathProgramCache]: Analyzing trace with hash 99831319, now seen corresponding path program 1 times [2021-12-15 17:23:06,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:06,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205886542] [2021-12-15 17:23:06,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:06,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:06,542 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:23:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:06,553 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:23:06,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:06,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1491346635, now seen corresponding path program 1 times [2021-12-15 17:23:06,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:06,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325140243] [2021-12-15 17:23:06,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:06,554 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:06,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:06,599 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:23:06,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:06,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325140243] [2021-12-15 17:23:06,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325140243] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:06,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:06,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:23:06,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294747883] [2021-12-15 17:23:06,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:07,568 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:23:07,572 INFO L158 Benchmark]: Toolchain (without parser) took 2762.16ms. Allocated memory was 107.0MB in the beginning and 138.4MB in the end (delta: 31.5MB). Free memory was 78.0MB in the beginning and 90.9MB in the end (delta: -12.8MB). Peak memory consumption was 61.9MB. Max. memory is 16.1GB. [2021-12-15 17:23:07,573 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 107.0MB. Free memory was 64.6MB in the beginning and 64.5MB in the end (delta: 46.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:23:07,573 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.51ms. Allocated memory is still 107.0MB. Free memory was 77.8MB in the beginning and 79.0MB in the end (delta: -1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 17:23:07,574 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.76ms. Allocated memory is still 107.0MB. Free memory was 79.0MB in the beginning and 76.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-15 17:23:07,574 INFO L158 Benchmark]: Boogie Preprocessor took 23.19ms. Allocated memory is still 107.0MB. Free memory was 76.1MB in the beginning and 74.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:23:07,574 INFO L158 Benchmark]: RCFGBuilder took 392.18ms. Allocated memory is still 107.0MB. Free memory was 74.4MB in the beginning and 53.8MB in the end (delta: 20.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-12-15 17:23:07,575 INFO L158 Benchmark]: BuchiAutomizer took 2027.54ms. Allocated memory is still 138.4MB. Free memory was 114.9MB in the beginning and 90.9MB in the end (delta: 24.0MB). Peak memory consumption was 67.7MB. Max. memory is 16.1GB. [2021-12-15 17:23:07,577 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.10ms. Allocated memory is still 107.0MB. Free memory was 64.6MB in the beginning and 64.5MB in the end (delta: 46.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.51ms. Allocated memory is still 107.0MB. Free memory was 77.8MB in the beginning and 79.0MB in the end (delta: -1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.76ms. Allocated memory is still 107.0MB. Free memory was 79.0MB in the beginning and 76.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.19ms. Allocated memory is still 107.0MB. Free memory was 76.1MB in the beginning and 74.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 392.18ms. Allocated memory is still 107.0MB. Free memory was 74.4MB in the beginning and 53.8MB in the end (delta: 20.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 2027.54ms. Allocated memory is still 138.4MB. Free memory was 114.9MB in the beginning and 90.9MB in the end (delta: 24.0MB). Peak memory consumption was 67.7MB. 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:23:07,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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