./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.6.1.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.1.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 e7078db7101404701d1361cc736476696e00d8cbe0085be82e13ec1c6956c8c2 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:23:03,704 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:23:03,740 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:23:03,784 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:23:03,785 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:23:03,788 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:23:03,789 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:23:03,791 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:23:03,793 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:23:03,797 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:23:03,798 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:23:03,799 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:23:03,799 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:23:03,801 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:23:03,803 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:23:03,805 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:23:03,806 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:23:03,807 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:23:03,809 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:23:03,814 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:23:03,815 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:23:03,816 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:23:03,818 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:23:03,818 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:23:03,824 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:23:03,824 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:23:03,824 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:23:03,826 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:23:03,826 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:23:03,827 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:23:03,827 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:23:03,828 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:23:03,829 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:23:03,830 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:23:03,830 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:23:03,831 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:23:03,831 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:23:03,831 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:23:03,831 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:23:03,832 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:23:03,832 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:23:03,834 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,864 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:23:03,865 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:23:03,865 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:23:03,865 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:23:03,866 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:23:03,867 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:23:03,867 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:23:03,867 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:23:03,867 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:23:03,867 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:23:03,868 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:23:03,868 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:23:03,868 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:23:03,869 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:23:03,869 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:23:03,869 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:23:03,869 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:23:03,869 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:23:03,869 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:23:03,870 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:23:03,870 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:23:03,870 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:23:03,870 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:23:03,870 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:23:03,870 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:23:03,871 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:23:03,871 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:23:03,871 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:23:03,871 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:23:03,871 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:23:03,872 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:23:03,872 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:23:03,873 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:23:03,873 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 -> e7078db7101404701d1361cc736476696e00d8cbe0085be82e13ec1c6956c8c2 [2021-12-15 17:23:04,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:23:04,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:23:04,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:23:04,096 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:23:04,099 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:23:04,100 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.6.1.ufo.UNBOUNDED.pals.c [2021-12-15 17:23:04,157 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54dfb10e8/abb1c6d01f754df781b215167ed522ab/FLAGb66e7cc44 [2021-12-15 17:23:04,570 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:23:04,571 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.6.1.ufo.UNBOUNDED.pals.c [2021-12-15 17:23:04,581 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54dfb10e8/abb1c6d01f754df781b215167ed522ab/FLAGb66e7cc44 [2021-12-15 17:23:04,950 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54dfb10e8/abb1c6d01f754df781b215167ed522ab [2021-12-15 17:23:04,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:23:04,954 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:23:04,957 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:23:04,957 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:23:04,960 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:23:04,961 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,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73f14b9d 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,962 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,968 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:23:05,005 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:23:05,210 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.1.ufo.UNBOUNDED.pals.c[15140,15153] [2021-12-15 17:23:05,214 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:23:05,222 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:23:05,277 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.1.ufo.UNBOUNDED.pals.c[15140,15153] [2021-12-15 17:23:05,278 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:23:05,290 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:23:05,290 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,290 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:23:05,291 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:23:05,292 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:23:05,292 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:23:05,298 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,308 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,336 INFO L137 Inliner]: procedures = 26, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 371 [2021-12-15 17:23:05,337 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:23:05,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:23:05,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:23:05,338 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:23:05,344 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,344 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,347 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,347 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,353 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,358 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,360 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,364 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:23:05,364 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:23:05,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:23:05,365 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:23:05,365 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,371 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:23:05,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:23:05,390 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,415 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,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:23:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:23:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:23:05,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:23:05,519 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:23:05,520 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:23:05,822 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:23:05,835 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:23:05,836 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 17:23:05,837 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,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:23:05,839 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:23:05,839 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:23:05,848 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:23:05,849 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:23:05,849 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,850 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76e5fb55 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,850 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:23:05,850 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,851 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76e5fb55 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,851 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:23:05,851 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,852 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals.c [2021-12-15 17:23:05,888 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:23:05,888 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:23:05,889 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:23:05,889 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:23:05,889 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:23:05,889 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:23:05,889 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:23:05,889 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:23:05,918 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,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2021-12-15 17:23:05,943 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:05,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:05,948 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:23:05,948 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,949 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:23:05,949 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,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2021-12-15 17:23:05,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:05,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:05,957 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:23:05,958 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,965 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(34, 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; 31#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; 58#L233true assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; 59#L233-1true init_#res#1 := init_~tmp~0#1; 12#L394true main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 33#L22true assume !(0 == assume_abort_if_not_~cond#1); 85#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; 32#L472-2true [2021-12-15 17:23:05,966 INFO L793 eck$LassoCheckResult]: Loop: 32#L472-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; 17#L78true assume !(0 != ~mode1~0 % 256); 68#L97true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 105#L97-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; 35#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; 96#L109true assume !(0 != ~mode2~0 % 256); 39#L122true assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 93#L122-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; 107#L109-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; 102#L134true assume !(0 != ~mode3~0 % 256); 100#L147true assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 80#L147-2true ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 56#L134-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; 69#L159true assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 27#L162true assume !(node4_~m4~0#1 != ~nomsg~0); 38#L162-1true ~mode4~0 := 0; 83#L159-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; 77#L184true assume !(0 != ~mode5~0 % 256); 70#L197true assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 90#L197-2true ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 74#L184-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; 95#L209true assume !(0 != ~mode6~0 % 256); 78#L222true assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 10#L222-2true ~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; 89#L209-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; 81#L402true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 6#L402-1true check_#res#1 := check_~tmp~1#1; 13#L422true 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; 72#L504true assume !(0 == assert_~arg#1 % 256); 36#L499true assume { :end_inline_assert } true; 32#L472-2true [2021-12-15 17:23:05,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:05,971 INFO L85 PathProgramCache]: Analyzing trace with hash 2030119858, now seen corresponding path program 1 times [2021-12-15 17:23:05,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:05,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189792199] [2021-12-15 17:23:05,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:05,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:06,184 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,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:06,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189792199] [2021-12-15 17:23:06,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189792199] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:06,186 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:06,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:23:06,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56787142] [2021-12-15 17:23:06,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:06,192 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:23:06,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:06,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1726820908, now seen corresponding path program 1 times [2021-12-15 17:23:06,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:06,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601458360] [2021-12-15 17:23:06,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:06,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:06,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:06,366 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,367 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:06,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601458360] [2021-12-15 17:23:06,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601458360] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:06,368 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:06,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:23:06,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898335000] [2021-12-15 17:23:06,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:06,374 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:23:06,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:23:06,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:23:06,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:23:06,411 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,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:23:06,519 INFO L93 Difference]: Finished difference Result 110 states and 185 transitions. [2021-12-15 17:23:06,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:23:06,524 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 110 states and 185 transitions. [2021-12-15 17:23:06,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 60 [2021-12-15 17:23:06,531 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 110 states to 106 states and 142 transitions. [2021-12-15 17:23:06,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 106 [2021-12-15 17:23:06,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 [2021-12-15 17:23:06,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 142 transitions. [2021-12-15 17:23:06,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:23:06,534 INFO L681 BuchiCegarLoop]: Abstraction has 106 states and 142 transitions. [2021-12-15 17:23:06,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 142 transitions. [2021-12-15 17:23:06,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2021-12-15 17:23:06,556 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,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 142 transitions. [2021-12-15 17:23:06,560 INFO L704 BuchiCegarLoop]: Abstraction has 106 states and 142 transitions. [2021-12-15 17:23:06,560 INFO L587 BuchiCegarLoop]: Abstraction has 106 states and 142 transitions. [2021-12-15 17:23:06,560 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:23:06,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 142 transitions. [2021-12-15 17:23:06,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 60 [2021-12-15 17:23:06,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:06,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:06,566 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,566 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,567 INFO L791 eck$LassoCheckResult]: Stem: 343#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(34, 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; 286#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; 287#L233 assume 0 == ~r1~0 % 256; 319#L234 assume ~id1~0 >= 0; 323#L235 assume 0 == ~st1~0; 310#L236 assume ~send1~0 == ~id1~0; 311#L237 assume 0 == ~mode1~0 % 256; 271#L238 assume ~id2~0 >= 0; 272#L239 assume 0 == ~st2~0; 269#L240 assume ~send2~0 == ~id2~0; 270#L241 assume 0 == ~mode2~0 % 256; 274#L242 assume ~id3~0 >= 0; 331#L243 assume 0 == ~st3~0; 246#L244 assume ~send3~0 == ~id3~0; 247#L245 assume 0 == ~mode3~0 % 256; 273#L246 assume ~id4~0 >= 0; 318#L247 assume 0 == ~st4~0; 341#L248 assume ~send4~0 == ~id4~0; 242#L249 assume 0 == ~mode4~0 % 256; 243#L250 assume ~id5~0 >= 0; 334#L251 assume 0 == ~st5~0; 299#L252 assume ~send5~0 == ~id5~0; 300#L253 assume 0 == ~mode5~0 % 256; 307#L254 assume ~id6~0 >= 0; 262#L255 assume 0 == ~st6~0; 263#L256 assume ~send6~0 == ~id6~0; 301#L257 assume 0 == ~mode6~0 % 256; 277#L258 assume ~id1~0 != ~id2~0; 278#L259 assume ~id1~0 != ~id3~0; 320#L260 assume ~id1~0 != ~id4~0; 321#L261 assume ~id1~0 != ~id5~0; 308#L262 assume ~id1~0 != ~id6~0; 309#L263 assume ~id2~0 != ~id3~0; 312#L264 assume ~id2~0 != ~id4~0; 313#L265 assume ~id2~0 != ~id5~0; 250#L266 assume ~id2~0 != ~id6~0; 251#L267 assume ~id3~0 != ~id4~0; 264#L268 assume ~id3~0 != ~id5~0; 265#L269 assume ~id3~0 != ~id6~0; 248#L270 assume ~id4~0 != ~id5~0; 249#L271 assume ~id4~0 != ~id6~0; 279#L272 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 290#L233-1 init_#res#1 := init_~tmp~0#1; 256#L394 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; 257#L22 assume !(0 == assume_abort_if_not_~cond#1); 289#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; 288#L472-2 [2021-12-15 17:23:06,567 INFO L793 eck$LassoCheckResult]: Loop: 288#L472-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; 266#L78 assume !(0 != ~mode1~0 % 256); 267#L97 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 327#L97-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; 291#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; 292#L109 assume !(0 != ~mode2~0 % 256); 297#L122 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 298#L122-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; 322#L109-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; 344#L134 assume !(0 != ~mode3~0 % 256); 342#L147 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 338#L147-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 316#L134-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; 317#L159 assume !(0 != ~mode4~0 % 256); 328#L172 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 305#L172-2 ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 296#L159-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; 335#L184 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 336#L187 assume !(node5_~m5~0#1 != ~nomsg~0); 260#L187-1 ~mode5~0 := 0; 332#L184-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; 333#L209 assume !(0 != ~mode6~0 % 256); 337#L222 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 252#L222-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; 253#L209-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; 339#L402 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 244#L402-1 check_#res#1 := check_~tmp~1#1; 245#L422 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; 258#L504 assume !(0 == assert_~arg#1 % 256); 293#L499 assume { :end_inline_assert } true; 288#L472-2 [2021-12-15 17:23:06,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:06,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1716035805, now seen corresponding path program 1 times [2021-12-15 17:23:06,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:06,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99383968] [2021-12-15 17:23:06,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:06,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:06,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:06,610 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:23:06,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:06,669 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:23:06,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:06,670 INFO L85 PathProgramCache]: Analyzing trace with hash 636068564, now seen corresponding path program 1 times [2021-12-15 17:23:06,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:06,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190213841] [2021-12-15 17:23:06,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:06,671 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:06,754 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,754 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:06,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190213841] [2021-12-15 17:23:06,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190213841] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:06,755 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:06,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:23:06,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220561840] [2021-12-15 17:23:06,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:06,756 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:23:06,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:23:06,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:23:06,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:23:06,757 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,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:23:06,799 INFO L93 Difference]: Finished difference Result 109 states and 144 transitions. [2021-12-15 17:23:06,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:23:06,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 144 transitions. [2021-12-15 17:23:06,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 60 [2021-12-15 17:23:06,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 106 states and 139 transitions. [2021-12-15 17:23:06,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 106 [2021-12-15 17:23:06,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 [2021-12-15 17:23:06,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 139 transitions. [2021-12-15 17:23:06,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:23:06,811 INFO L681 BuchiCegarLoop]: Abstraction has 106 states and 139 transitions. [2021-12-15 17:23:06,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 139 transitions. [2021-12-15 17:23:06,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2021-12-15 17:23:06,815 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,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 139 transitions. [2021-12-15 17:23:06,816 INFO L704 BuchiCegarLoop]: Abstraction has 106 states and 139 transitions. [2021-12-15 17:23:06,816 INFO L587 BuchiCegarLoop]: Abstraction has 106 states and 139 transitions. [2021-12-15 17:23:06,816 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:23:06,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 139 transitions. [2021-12-15 17:23:06,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 60 [2021-12-15 17:23:06,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:06,817 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:06,819 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,819 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,821 INFO L791 eck$LassoCheckResult]: Stem: 570#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(34, 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; 513#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; 514#L233 assume 0 == ~r1~0 % 256; 546#L234 assume ~id1~0 >= 0; 550#L235 assume 0 == ~st1~0; 537#L236 assume ~send1~0 == ~id1~0; 538#L237 assume 0 == ~mode1~0 % 256; 498#L238 assume ~id2~0 >= 0; 499#L239 assume 0 == ~st2~0; 496#L240 assume ~send2~0 == ~id2~0; 497#L241 assume 0 == ~mode2~0 % 256; 501#L242 assume ~id3~0 >= 0; 558#L243 assume 0 == ~st3~0; 473#L244 assume ~send3~0 == ~id3~0; 474#L245 assume 0 == ~mode3~0 % 256; 500#L246 assume ~id4~0 >= 0; 545#L247 assume 0 == ~st4~0; 568#L248 assume ~send4~0 == ~id4~0; 469#L249 assume 0 == ~mode4~0 % 256; 470#L250 assume ~id5~0 >= 0; 561#L251 assume 0 == ~st5~0; 526#L252 assume ~send5~0 == ~id5~0; 527#L253 assume 0 == ~mode5~0 % 256; 534#L254 assume ~id6~0 >= 0; 489#L255 assume 0 == ~st6~0; 490#L256 assume ~send6~0 == ~id6~0; 528#L257 assume 0 == ~mode6~0 % 256; 504#L258 assume ~id1~0 != ~id2~0; 505#L259 assume ~id1~0 != ~id3~0; 547#L260 assume ~id1~0 != ~id4~0; 548#L261 assume ~id1~0 != ~id5~0; 535#L262 assume ~id1~0 != ~id6~0; 536#L263 assume ~id2~0 != ~id3~0; 539#L264 assume ~id2~0 != ~id4~0; 540#L265 assume ~id2~0 != ~id5~0; 477#L266 assume ~id2~0 != ~id6~0; 478#L267 assume ~id3~0 != ~id4~0; 491#L268 assume ~id3~0 != ~id5~0; 492#L269 assume ~id3~0 != ~id6~0; 475#L270 assume ~id4~0 != ~id5~0; 476#L271 assume ~id4~0 != ~id6~0; 506#L272 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 517#L233-1 init_#res#1 := init_~tmp~0#1; 483#L394 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; 484#L22 assume !(0 == assume_abort_if_not_~cond#1); 516#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; 515#L472-2 [2021-12-15 17:23:06,821 INFO L793 eck$LassoCheckResult]: Loop: 515#L472-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; 493#L78 assume !(0 != ~mode1~0 % 256); 494#L97 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 554#L97-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; 518#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; 519#L109 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 529#L112 assume !(node2_~m2~0#1 != ~nomsg~0); 503#L112-1 ~mode2~0 := 0; 549#L109-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; 571#L134 assume !(0 != ~mode3~0 % 256); 569#L147 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 565#L147-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 543#L134-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; 544#L159 assume !(0 != ~mode4~0 % 256); 555#L172 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 532#L172-2 ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 523#L159-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; 562#L184 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 563#L187 assume !(node5_~m5~0#1 != ~nomsg~0); 487#L187-1 ~mode5~0 := 0; 559#L184-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; 560#L209 assume !(0 != ~mode6~0 % 256); 564#L222 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 479#L222-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; 480#L209-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; 566#L402 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 533#L403 assume ~r1~0 % 256 >= 6; 481#L407 assume ~r1~0 % 256 < 6;check_~tmp~1#1 := 1; 471#L402-1 check_#res#1 := check_~tmp~1#1; 472#L422 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; 485#L504 assume !(0 == assert_~arg#1 % 256); 520#L499 assume { :end_inline_assert } true; 515#L472-2 [2021-12-15 17:23:06,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:06,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1716035805, now seen corresponding path program 2 times [2021-12-15 17:23:06,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:06,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771811589] [2021-12-15 17:23:06,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:06,823 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:06,841 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:23:06,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:06,865 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:23:06,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:06,866 INFO L85 PathProgramCache]: Analyzing trace with hash -793816562, now seen corresponding path program 1 times [2021-12-15 17:23:06,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:06,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907193655] [2021-12-15 17:23:06,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:06,867 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:06,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:06,909 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,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:06,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907193655] [2021-12-15 17:23:06,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907193655] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:06,910 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:06,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:23:06,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591246569] [2021-12-15 17:23:06,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:06,910 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:23:06,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:23:06,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:23:06,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:23:06,911 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,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:23:06,947 INFO L93 Difference]: Finished difference Result 160 states and 221 transitions. [2021-12-15 17:23:06,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:23:06,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 221 transitions. [2021-12-15 17:23:06,950 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 114 [2021-12-15 17:23:06,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 160 states and 221 transitions. [2021-12-15 17:23:06,951 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 160 [2021-12-15 17:23:06,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160 [2021-12-15 17:23:06,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 160 states and 221 transitions. [2021-12-15 17:23:06,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:23:06,953 INFO L681 BuchiCegarLoop]: Abstraction has 160 states and 221 transitions. [2021-12-15 17:23:06,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states and 221 transitions. [2021-12-15 17:23:06,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2021-12-15 17:23:06,959 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,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 218 transitions. [2021-12-15 17:23:06,960 INFO L704 BuchiCegarLoop]: Abstraction has 158 states and 218 transitions. [2021-12-15 17:23:06,960 INFO L587 BuchiCegarLoop]: Abstraction has 158 states and 218 transitions. [2021-12-15 17:23:06,960 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:23:06,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 158 states and 218 transitions. [2021-12-15 17:23:06,962 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 112 [2021-12-15 17:23:06,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:06,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:06,968 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,969 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,969 INFO L791 eck$LassoCheckResult]: Stem: 845#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(34, 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; 786#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; 787#L233 assume 0 == ~r1~0 % 256; 820#L234 assume ~id1~0 >= 0; 824#L235 assume 0 == ~st1~0; 811#L236 assume ~send1~0 == ~id1~0; 812#L237 assume 0 == ~mode1~0 % 256; 770#L238 assume ~id2~0 >= 0; 771#L239 assume 0 == ~st2~0; 768#L240 assume ~send2~0 == ~id2~0; 769#L241 assume 0 == ~mode2~0 % 256; 773#L242 assume ~id3~0 >= 0; 832#L243 assume 0 == ~st3~0; 745#L244 assume ~send3~0 == ~id3~0; 746#L245 assume 0 == ~mode3~0 % 256; 772#L246 assume ~id4~0 >= 0; 819#L247 assume 0 == ~st4~0; 843#L248 assume ~send4~0 == ~id4~0; 741#L249 assume 0 == ~mode4~0 % 256; 742#L250 assume ~id5~0 >= 0; 835#L251 assume 0 == ~st5~0; 799#L252 assume ~send5~0 == ~id5~0; 800#L253 assume 0 == ~mode5~0 % 256; 807#L254 assume ~id6~0 >= 0; 761#L255 assume 0 == ~st6~0; 762#L256 assume ~send6~0 == ~id6~0; 801#L257 assume 0 == ~mode6~0 % 256; 776#L258 assume ~id1~0 != ~id2~0; 777#L259 assume ~id1~0 != ~id3~0; 821#L260 assume ~id1~0 != ~id4~0; 822#L261 assume ~id1~0 != ~id5~0; 809#L262 assume ~id1~0 != ~id6~0; 810#L263 assume ~id2~0 != ~id3~0; 813#L264 assume ~id2~0 != ~id4~0; 814#L265 assume ~id2~0 != ~id5~0; 749#L266 assume ~id2~0 != ~id6~0; 750#L267 assume ~id3~0 != ~id4~0; 763#L268 assume ~id3~0 != ~id5~0; 764#L269 assume ~id3~0 != ~id6~0; 747#L270 assume ~id4~0 != ~id5~0; 748#L271 assume ~id4~0 != ~id6~0; 778#L272 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 790#L233-1 init_#res#1 := init_~tmp~0#1; 755#L394 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; 756#L22 assume !(0 == assume_abort_if_not_~cond#1); 789#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; 788#L472-2 [2021-12-15 17:23:06,969 INFO L793 eck$LassoCheckResult]: Loop: 788#L472-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; 765#L78 assume !(0 != ~mode1~0 % 256); 766#L97 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 828#L97-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; 791#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; 792#L109 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 802#L112 assume !(node2_~m2~0#1 != ~nomsg~0); 775#L112-1 ~mode2~0 := 0; 823#L109-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; 846#L134 assume !(0 != ~mode3~0 % 256); 844#L147 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 839#L147-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 817#L134-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 818#L159 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 779#L162 assume !(node4_~m4~0#1 != ~nomsg~0); 780#L162-1 ~mode4~0 := 0; 796#L159-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; 841#L184 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 861#L187 assume !(node5_~m5~0#1 != ~nomsg~0); 858#L187-1 ~mode5~0 := 0; 857#L184-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; 856#L209 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 853#L212 assume !(node6_~m6~0#1 != ~nomsg~0); 850#L212-1 ~mode6~0 := 0; 849#L209-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; 848#L402 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 847#L403 assume !(~r1~0 % 256 >= 6); 784#L406 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; 785#L407 assume ~r1~0 % 256 < 6;check_~tmp~1#1 := 1; 743#L402-1 check_#res#1 := check_~tmp~1#1; 744#L422 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; 757#L504 assume !(0 == assert_~arg#1 % 256); 793#L499 assume { :end_inline_assert } true; 788#L472-2 [2021-12-15 17:23:06,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:06,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1716035805, now seen corresponding path program 3 times [2021-12-15 17:23:06,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:06,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924506113] [2021-12-15 17:23:06,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:06,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:06,991 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:23:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:07,011 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:23:07,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:07,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1019577779, now seen corresponding path program 1 times [2021-12-15 17:23:07,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:07,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357689161] [2021-12-15 17:23:07,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:07,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:07,023 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:23:07,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:07,035 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:23:07,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:07,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1684211563, now seen corresponding path program 1 times [2021-12-15 17:23:07,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:07,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787775071] [2021-12-15 17:23:07,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:07,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:07,091 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:07,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:07,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787775071] [2021-12-15 17:23:07,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787775071] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:07,092 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:07,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:23:07,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540949783] [2021-12-15 17:23:07,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:08,202 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:08,205 INFO L158 Benchmark]: Toolchain (without parser) took 3250.89ms. Allocated memory was 92.3MB in the beginning and 146.8MB in the end (delta: 54.5MB). Free memory was 60.0MB in the beginning and 83.5MB in the end (delta: -23.5MB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. [2021-12-15 17:23:08,206 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 92.3MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:23:08,206 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.46ms. Allocated memory was 92.3MB in the beginning and 121.6MB in the end (delta: 29.4MB). Free memory was 59.8MB in the beginning and 92.4MB in the end (delta: -32.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 17:23:08,210 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.73ms. Allocated memory is still 121.6MB. Free memory was 92.4MB in the beginning and 89.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-15 17:23:08,211 INFO L158 Benchmark]: Boogie Preprocessor took 25.96ms. Allocated memory is still 121.6MB. Free memory was 89.4MB in the beginning and 87.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:23:08,212 INFO L158 Benchmark]: RCFGBuilder took 473.50ms. Allocated memory is still 121.6MB. Free memory was 87.7MB in the beginning and 66.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-12-15 17:23:08,214 INFO L158 Benchmark]: BuchiAutomizer took 2365.60ms. Allocated memory was 121.6MB in the beginning and 146.8MB in the end (delta: 25.2MB). Free memory was 66.7MB in the beginning and 83.5MB in the end (delta: -16.8MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2021-12-15 17:23:08,217 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.20ms. Allocated memory is still 92.3MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.46ms. Allocated memory was 92.3MB in the beginning and 121.6MB in the end (delta: 29.4MB). Free memory was 59.8MB in the beginning and 92.4MB in the end (delta: -32.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.73ms. Allocated memory is still 121.6MB. Free memory was 92.4MB in the beginning and 89.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.96ms. Allocated memory is still 121.6MB. Free memory was 89.4MB in the beginning and 87.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 473.50ms. Allocated memory is still 121.6MB. Free memory was 87.7MB in the beginning and 66.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 2365.60ms. Allocated memory was 121.6MB in the beginning and 146.8MB in the end (delta: 25.2MB). Free memory was 66.7MB in the beginning and 83.5MB in the end (delta: -16.8MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: UnsupportedOperationException: Set is immutable de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: UnsupportedOperationException: Set is immutable: de.uni_freiburg.informatik.ultimate.util.datastructures.ImmutableSet.retainAll(ImmutableSet.java:338) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-15 17:23:08,254 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