./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.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_floodmax.3.4.ufo.BOUNDED-6.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 904bd1313458c4f9af8d5bf1208ba922a2079eb77883d7ecd1ca28ceda09c9f6 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:22:23,976 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:22:23,978 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:22:24,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:22:24,014 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:22:24,016 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:22:24,017 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:22:24,019 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:22:24,021 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:22:24,024 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:22:24,025 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:22:24,026 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:22:24,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:22:24,028 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:22:24,029 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:22:24,033 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:22:24,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:22:24,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:22:24,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:22:24,040 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:22:24,041 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:22:24,041 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:22:24,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:22:24,048 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:22:24,052 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:22:24,052 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:22:24,053 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:22:24,054 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:22:24,054 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:22:24,055 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:22:24,055 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:22:24,056 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:22:24,057 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:22:24,057 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:22:24,058 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:22:24,058 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:22:24,059 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:22:24,059 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:22:24,059 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:22:24,060 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:22:24,060 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:22:24,061 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-15 17:22:24,092 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:22:24,092 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:22:24,093 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:22:24,093 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:22:24,094 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:22:24,094 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:22:24,094 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:22:24,094 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:22:24,094 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:22:24,094 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:22:24,095 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:22:24,095 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:22:24,095 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:22:24,095 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:22:24,096 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:22:24,096 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:22:24,096 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:22:24,096 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:22:24,096 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:22:24,096 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:22:24,096 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:22:24,096 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:22:24,097 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:22:24,097 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:22:24,098 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:22:24,098 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:22:24,098 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:22:24,098 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:22:24,098 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:22:24,099 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:22:24,099 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:22:24,099 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:22:24,100 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:22:24,100 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 -> 904bd1313458c4f9af8d5bf1208ba922a2079eb77883d7ecd1ca28ceda09c9f6 [2021-12-15 17:22:24,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:22:24,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:22:24,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:22:24,299 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:22:24,299 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:22:24,300 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c [2021-12-15 17:22:24,343 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c0174d6d/0a5419cdcdf14af7a6f5e3e5310f03d8/FLAGc8d683e9c [2021-12-15 17:22:24,792 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:22:24,792 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c [2021-12-15 17:22:24,802 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c0174d6d/0a5419cdcdf14af7a6f5e3e5310f03d8/FLAGc8d683e9c [2021-12-15 17:22:24,813 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c0174d6d/0a5419cdcdf14af7a6f5e3e5310f03d8 [2021-12-15 17:22:24,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:22:24,819 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:22:24,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:22:24,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:22:24,824 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:22:24,825 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:22:24" (1/1) ... [2021-12-15 17:22:24,826 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@285274de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:24, skipping insertion in model container [2021-12-15 17:22:24,826 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:22:24" (1/1) ... [2021-12-15 17:22:24,831 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:22:24,866 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:22:24,997 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_floodmax.3.4.ufo.BOUNDED-6.pals.c[12764,12777] [2021-12-15 17:22:24,998 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:22:25,004 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:22:25,043 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_floodmax.3.4.ufo.BOUNDED-6.pals.c[12764,12777] [2021-12-15 17:22:25,044 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:22:25,054 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:22:25,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:25 WrapperNode [2021-12-15 17:22:25,055 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:22:25,056 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:22:25,056 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:22:25,056 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:22:25,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:25" (1/1) ... [2021-12-15 17:22:25,085 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:25" (1/1) ... [2021-12-15 17:22:25,108 INFO L137 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 421 [2021-12-15 17:22:25,109 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:22:25,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:22:25,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:22:25,111 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:22:25,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:25" (1/1) ... [2021-12-15 17:22:25,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:25" (1/1) ... [2021-12-15 17:22:25,121 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:25" (1/1) ... [2021-12-15 17:22:25,130 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:25" (1/1) ... [2021-12-15 17:22:25,136 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:25" (1/1) ... [2021-12-15 17:22:25,152 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:25" (1/1) ... [2021-12-15 17:22:25,153 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:25" (1/1) ... [2021-12-15 17:22:25,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:22:25,157 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:22:25,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:22:25,157 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:22:25,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:25" (1/1) ... [2021-12-15 17:22:25,180 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:22:25,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:22:25,224 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:22:25,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-15 17:22:25,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:22:25,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:22:25,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:22:25,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:22:25,394 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:22:25,395 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:22:25,738 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:22:25,745 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:22:25,746 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 17:22:25,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:22:25 BoogieIcfgContainer [2021-12-15 17:22:25,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:22:25,748 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:22:25,748 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:22:25,750 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:22:25,751 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:25,751 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:22:24" (1/3) ... [2021-12-15 17:22:25,764 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7fd05d99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:22:25, skipping insertion in model container [2021-12-15 17:22:25,764 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:25,764 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:25" (2/3) ... [2021-12-15 17:22:25,765 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7fd05d99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:22:25, skipping insertion in model container [2021-12-15 17:22:25,765 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:25,765 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:22:25" (3/3) ... [2021-12-15 17:22:25,766 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.BOUNDED-6.pals.c [2021-12-15 17:22:25,831 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:22:25,831 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:22:25,832 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:22:25,832 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:22:25,832 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:22:25,832 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:22:25,832 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:22:25,832 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:22:25,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 130 states, 129 states have (on average 1.751937984496124) internal successors, (226), 129 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:22:25,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2021-12-15 17:22:25,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:25,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:25,874 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] [2021-12-15 17:22:25,874 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:25,874 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:22:25,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 130 states, 129 states have (on average 1.751937984496124) internal successors, (226), 129 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:22:25,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2021-12-15 17:22:25,883 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:25,883 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:25,884 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] [2021-12-15 17:22:25,885 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:25,890 INFO L791 eck$LassoCheckResult]: Stem: 120#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 46#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~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_#t~post39#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 95#L228true assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 51#L231-1true init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 34#L241true assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 30#L244-1true init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 61#L254true assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 64#L257-1true init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 27#L267true assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 15#L270-1true init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 102#L280true assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 81#L283-1true init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 119#L293true assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 79#L296-1true init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 129#L306true assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 116#L306-1true init_#res#1 := init_~tmp___5~0#1; 111#L415true main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; 53#L509true assume !(0 == main_~i2~0#1); 90#L509-2true ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 35#L523-2true [2021-12-15 17:22:25,895 INFO L793 eck$LassoCheckResult]: Loop: 35#L523-2true assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 70#L75true assume !(0 != ~mode1~0 % 256); 66#L100true assume !(~r1~0 < 1); 84#L100-1true ~mode1~0 := 1; 117#L75-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 101#L118true assume !(0 != ~mode2~0 % 256); 105#L143true assume !(~r2~0 < 2); 96#L143-1true ~mode2~0 := 1; 67#L118-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 14#L161true assume !(0 != ~mode3~0 % 256); 74#L186true assume !(~r3~0 < 2); 29#L186-1true ~mode3~0 := 1; 6#L161-2true assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 21#L423true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 71#L423-1true check_#res#1 := check_~tmp~1#1; 28#L471true main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#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; 87#L553true assume !(0 == assert_~arg#1 % 256); 72#L548true assume { :end_inline_assert } true;main_#t~post39#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post39#1;havoc main_#t~post39#1; 35#L523-2true [2021-12-15 17:22:25,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:25,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1727567734, now seen corresponding path program 1 times [2021-12-15 17:22:25,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:25,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312400428] [2021-12-15 17:22:25,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:25,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:26,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:22:26,197 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:26,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312400428] [2021-12-15 17:22:26,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312400428] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:26,203 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:26,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:26,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807168722] [2021-12-15 17:22:26,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:26,216 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:22:26,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:26,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1518597457, now seen corresponding path program 1 times [2021-12-15 17:22:26,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:26,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090868977] [2021-12-15 17:22:26,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:26,218 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:26,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:26,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:22:26,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:26,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090868977] [2021-12-15 17:22:26,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090868977] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:26,352 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:26,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:26,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388224622] [2021-12-15 17:22:26,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:26,353 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:26,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:26,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:22:26,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:22:26,394 INFO L87 Difference]: Start difference. First operand has 130 states, 129 states have (on average 1.751937984496124) internal successors, (226), 129 states have internal predecessors, (226), 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 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:22:26,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:26,495 INFO L93 Difference]: Finished difference Result 134 states and 226 transitions. [2021-12-15 17:22:26,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:22:26,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 226 transitions. [2021-12-15 17:22:26,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2021-12-15 17:22:26,510 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 125 states and 210 transitions. [2021-12-15 17:22:26,511 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2021-12-15 17:22:26,511 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2021-12-15 17:22:26,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 210 transitions. [2021-12-15 17:22:26,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:26,513 INFO L681 BuchiCegarLoop]: Abstraction has 125 states and 210 transitions. [2021-12-15 17:22:26,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 210 transitions. [2021-12-15 17:22:26,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-12-15 17:22:26,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.68) internal successors, (210), 124 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:22:26,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 210 transitions. [2021-12-15 17:22:26,545 INFO L704 BuchiCegarLoop]: Abstraction has 125 states and 210 transitions. [2021-12-15 17:22:26,545 INFO L587 BuchiCegarLoop]: Abstraction has 125 states and 210 transitions. [2021-12-15 17:22:26,545 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:22:26,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 210 transitions. [2021-12-15 17:22:26,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2021-12-15 17:22:26,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:26,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:26,551 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] [2021-12-15 17:22:26,551 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] [2021-12-15 17:22:26,551 INFO L791 eck$LassoCheckResult]: Stem: 405#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 353#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~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_#t~post39#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 354#L228 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 360#L231-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 337#L241 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 295#L244-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 335#L254 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 345#L257-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 331#L267 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 299#L270-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 309#L280 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 381#L283-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 386#L293 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 347#L296-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 385#L306 assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 284#L306-1 init_#res#1 := init_~tmp___5~0#1; 403#L415 main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; 362#L509 assume !(0 == main_~i2~0#1); 363#L509-2 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 338#L523-2 [2021-12-15 17:22:26,552 INFO L793 eck$LassoCheckResult]: Loop: 338#L523-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 339#L75 assume !(0 != ~mode1~0 % 256); 375#L100 assume !(~r1~0 < 1); 355#L100-1 ~mode1~0 := 1; 328#L75-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 395#L118 assume !(0 != ~mode2~0 % 256); 396#L143 assume !(~r2~0 < 2); 350#L143-1 ~mode2~0 := 1; 377#L118-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 306#L161 assume !(0 != ~mode3~0 % 256); 308#L186 assume !(~r3~0 < 2); 334#L186-1 ~mode3~0 := 1; 287#L161-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 288#L423 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 319#L424 assume ~st1~0 + ~nl1~0 <= 1; 401#L425 assume ~st2~0 + ~nl2~0 <= 1; 402#L426 assume ~st3~0 + ~nl3~0 <= 1; 394#L427 assume ~r1~0 >= 2; 311#L431 assume ~r1~0 < 2; 351#L436 assume ~r1~0 >= 2; 322#L441 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 323#L423-1 check_#res#1 := check_~tmp~1#1; 332#L471 main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#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; 333#L553 assume !(0 == assert_~arg#1 % 256); 379#L548 assume { :end_inline_assert } true;main_#t~post39#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post39#1;havoc main_#t~post39#1; 338#L523-2 [2021-12-15 17:22:26,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:26,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1727567734, now seen corresponding path program 2 times [2021-12-15 17:22:26,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:26,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501110407] [2021-12-15 17:22:26,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:26,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:26,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:22:26,597 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:26,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501110407] [2021-12-15 17:22:26,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501110407] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:26,598 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:26,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:26,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75039074] [2021-12-15 17:22:26,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:26,599 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:22:26,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:26,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1802356988, now seen corresponding path program 1 times [2021-12-15 17:22:26,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:26,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146437322] [2021-12-15 17:22:26,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:26,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:26,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:22:26,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:26,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146437322] [2021-12-15 17:22:26,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146437322] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:26,627 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:26,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:22:26,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800921570] [2021-12-15 17:22:26,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:26,627 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:26,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:26,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:22:26,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:22:26,628 INFO L87 Difference]: Start difference. First operand 125 states and 210 transitions. cyclomatic complexity: 86 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:22:26,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:26,679 INFO L93 Difference]: Finished difference Result 196 states and 320 transitions. [2021-12-15 17:22:26,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 17:22:26,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 196 states and 320 transitions. [2021-12-15 17:22:26,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2021-12-15 17:22:26,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 196 states to 193 states and 291 transitions. [2021-12-15 17:22:26,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 193 [2021-12-15 17:22:26,684 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 193 [2021-12-15 17:22:26,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 193 states and 291 transitions. [2021-12-15 17:22:26,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:26,685 INFO L681 BuchiCegarLoop]: Abstraction has 193 states and 291 transitions. [2021-12-15 17:22:26,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states and 291 transitions. [2021-12-15 17:22:26,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 125. [2021-12-15 17:22:26,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.464) internal successors, (183), 124 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:22:26,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 183 transitions. [2021-12-15 17:22:26,691 INFO L704 BuchiCegarLoop]: Abstraction has 125 states and 183 transitions. [2021-12-15 17:22:26,691 INFO L587 BuchiCegarLoop]: Abstraction has 125 states and 183 transitions. [2021-12-15 17:22:26,692 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:22:26,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 183 transitions. [2021-12-15 17:22:26,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2021-12-15 17:22:26,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:26,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:26,696 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] [2021-12-15 17:22:26,696 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] [2021-12-15 17:22:26,696 INFO L791 eck$LassoCheckResult]: Stem: 739#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 687#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~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_#t~post39#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 688#L228 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 694#L231-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 671#L241 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 628#L244-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 668#L254 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 679#L257-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 664#L267 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 632#L270-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 642#L280 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 715#L283-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 721#L293 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 681#L296-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 719#L306 assume ~id1~0 != ~id2~0; 723#L307 assume ~id1~0 != ~id3~0; 637#L308 assume ~id2~0 != ~id3~0; 638#L309 assume ~id1~0 >= 0; 722#L310 assume ~id2~0 >= 0; 701#L311 assume ~id3~0 >= 0; 702#L312 assume 0 == ~r1~0; 662#L313 assume 0 == ~r2~0; 663#L314 assume 0 == ~r3~0; 692#L315 assume 0 != init_~r122~0#1 % 256; 693#L316 assume 0 != init_~r132~0#1 % 256; 618#L317 assume 0 != init_~r212~0#1 % 256; 619#L318 assume 0 != init_~r232~0#1 % 256; 740#L319 assume 0 != init_~r312~0#1 % 256; 727#L320 assume 0 != init_~r322~0#1 % 256; 717#L321 assume ~max1~0 == ~id1~0; 718#L322 assume ~max2~0 == ~id2~0; 616#L323 assume ~max3~0 == ~id3~0; 617#L324 assume 0 == ~st1~0; 645#L325 assume 0 == ~st2~0; 670#L326 assume 0 == ~st3~0; 653#L327 assume 0 == ~nl1~0; 654#L328 assume 0 == ~nl2~0; 682#L329 assume 0 == ~nl3~0; 683#L330 assume 0 == ~mode1~0 % 256; 635#L331 assume 0 == ~mode2~0 % 256; 636#L332 assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; 669#L306-1 init_#res#1 := init_~tmp___5~0#1; 737#L415 main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; 699#L509 assume !(0 == main_~i2~0#1); 700#L509-2 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 674#L523-2 [2021-12-15 17:22:26,697 INFO L793 eck$LassoCheckResult]: Loop: 674#L523-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 675#L75 assume !(0 != ~mode1~0 % 256); 709#L100 assume !(~r1~0 < 1); 689#L100-1 ~mode1~0 := 1; 661#L75-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 729#L118 assume !(0 != ~mode2~0 % 256); 730#L143 assume !(~r2~0 < 2); 684#L143-1 ~mode2~0 := 1; 711#L118-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 639#L161 assume !(0 != ~mode3~0 % 256); 641#L186 assume !(~r3~0 < 2); 667#L186-1 ~mode3~0 := 1; 620#L161-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 621#L423 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 650#L424 assume ~st1~0 + ~nl1~0 <= 1; 735#L425 assume ~st2~0 + ~nl2~0 <= 1; 736#L426 assume ~st3~0 + ~nl3~0 <= 1; 728#L427 assume ~r1~0 >= 2; 644#L431 assume ~r1~0 < 2; 685#L436 assume ~r1~0 >= 2; 655#L441 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 656#L423-1 check_#res#1 := check_~tmp~1#1; 665#L471 main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#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; 666#L553 assume !(0 == assert_~arg#1 % 256); 713#L548 assume { :end_inline_assert } true;main_#t~post39#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post39#1;havoc main_#t~post39#1; 674#L523-2 [2021-12-15 17:22:26,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:26,697 INFO L85 PathProgramCache]: Analyzing trace with hash -97176065, now seen corresponding path program 1 times [2021-12-15 17:22:26,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:26,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88215896] [2021-12-15 17:22:26,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:26,698 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:26,731 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:26,790 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:26,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:26,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1802356988, now seen corresponding path program 2 times [2021-12-15 17:22:26,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:26,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079562124] [2021-12-15 17:22:26,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:26,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:26,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:22:26,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:26,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079562124] [2021-12-15 17:22:26,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079562124] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:26,810 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:26,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:22:26,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707489011] [2021-12-15 17:22:26,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:26,811 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:26,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:26,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:22:26,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:22:26,812 INFO L87 Difference]: Start difference. First operand 125 states and 183 transitions. cyclomatic complexity: 59 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:22:26,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:26,836 INFO L93 Difference]: Finished difference Result 177 states and 260 transitions. [2021-12-15 17:22:26,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:22:26,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 177 states and 260 transitions. [2021-12-15 17:22:26,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 120 [2021-12-15 17:22:26,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 177 states to 177 states and 260 transitions. [2021-12-15 17:22:26,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 177 [2021-12-15 17:22:26,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 177 [2021-12-15 17:22:26,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 177 states and 260 transitions. [2021-12-15 17:22:26,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:26,842 INFO L681 BuchiCegarLoop]: Abstraction has 177 states and 260 transitions. [2021-12-15 17:22:26,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states and 260 transitions. [2021-12-15 17:22:26,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2021-12-15 17:22:26,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 177 states have (on average 1.4689265536723164) internal successors, (260), 176 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:22:26,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 260 transitions. [2021-12-15 17:22:26,848 INFO L704 BuchiCegarLoop]: Abstraction has 177 states and 260 transitions. [2021-12-15 17:22:26,848 INFO L587 BuchiCegarLoop]: Abstraction has 177 states and 260 transitions. [2021-12-15 17:22:26,848 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:22:26,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 177 states and 260 transitions. [2021-12-15 17:22:26,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 120 [2021-12-15 17:22:26,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:26,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:26,850 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] [2021-12-15 17:22:26,850 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] [2021-12-15 17:22:26,851 INFO L791 eck$LassoCheckResult]: Stem: 1057#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 994#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~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_#t~post39#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 995#L228 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 1001#L231-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 978#L241 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 936#L244-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 976#L254 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 986#L257-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 971#L267 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 940#L270-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 950#L280 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 1024#L283-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 1031#L293 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 988#L296-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 1029#L306 assume ~id1~0 != ~id2~0; 1033#L307 assume ~id1~0 != ~id3~0; 945#L308 assume ~id2~0 != ~id3~0; 946#L309 assume ~id1~0 >= 0; 1032#L310 assume ~id2~0 >= 0; 1008#L311 assume ~id3~0 >= 0; 1009#L312 assume 0 == ~r1~0; 969#L313 assume 0 == ~r2~0; 970#L314 assume 0 == ~r3~0; 997#L315 assume 0 != init_~r122~0#1 % 256; 998#L316 assume 0 != init_~r132~0#1 % 256; 926#L317 assume 0 != init_~r212~0#1 % 256; 927#L318 assume 0 != init_~r232~0#1 % 256; 1060#L319 assume 0 != init_~r312~0#1 % 256; 1038#L320 assume 0 != init_~r322~0#1 % 256; 1026#L321 assume ~max1~0 == ~id1~0; 1027#L322 assume ~max2~0 == ~id2~0; 924#L323 assume ~max3~0 == ~id3~0; 925#L324 assume 0 == ~st1~0; 951#L325 assume 0 == ~st2~0; 977#L326 assume 0 == ~st3~0; 961#L327 assume 0 == ~nl1~0; 962#L328 assume 0 == ~nl2~0; 989#L329 assume 0 == ~nl3~0; 990#L330 assume 0 == ~mode1~0 % 256; 943#L331 assume 0 == ~mode2~0 % 256; 944#L332 assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; 975#L306-1 init_#res#1 := init_~tmp___5~0#1; 1054#L415 main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; 1003#L509 assume !(0 == main_~i2~0#1); 1004#L509-2 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 1037#L523-2 [2021-12-15 17:22:26,851 INFO L793 eck$LassoCheckResult]: Loop: 1037#L523-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 1062#L75 assume !(0 != ~mode1~0 % 256); 1061#L100 assume !(~r1~0 < 1); 996#L100-1 ~mode1~0 := 1; 1095#L75-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 1092#L118 assume !(0 != ~mode2~0 % 256); 1088#L143 assume !(~r2~0 < 2); 1040#L143-1 ~mode2~0 := 1; 1019#L118-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 1020#L161 assume !(0 != ~mode3~0 % 256); 1078#L186 assume !(~r3~0 < 2); 1075#L186-1 ~mode3~0 := 1; 1073#L161-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 1072#L423 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 1071#L424 assume ~st1~0 + ~nl1~0 <= 1; 1070#L425 assume ~st2~0 + ~nl2~0 <= 1; 1069#L426 assume ~st3~0 + ~nl3~0 <= 1; 1068#L427 assume !(~r1~0 >= 2); 952#L430 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 953#L431 assume ~r1~0 < 2; 1067#L436 assume !(~r1~0 >= 2); 1048#L440 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 1049#L441 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 1066#L423-1 check_#res#1 := check_~tmp~1#1; 1065#L471 main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#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; 1064#L553 assume !(0 == assert_~arg#1 % 256); 1063#L548 assume { :end_inline_assert } true;main_#t~post39#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post39#1;havoc main_#t~post39#1; 1037#L523-2 [2021-12-15 17:22:26,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:26,852 INFO L85 PathProgramCache]: Analyzing trace with hash -97176065, now seen corresponding path program 2 times [2021-12-15 17:22:26,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:26,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934145451] [2021-12-15 17:22:26,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:26,852 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:26,873 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:26,901 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:26,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:26,902 INFO L85 PathProgramCache]: Analyzing trace with hash -77605116, now seen corresponding path program 1 times [2021-12-15 17:22:26,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:26,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477908271] [2021-12-15 17:22:26,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:26,903 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:26,911 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:26,935 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:26,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:26,936 INFO L85 PathProgramCache]: Analyzing trace with hash 2113327686, now seen corresponding path program 1 times [2021-12-15 17:22:26,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:26,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325010540] [2021-12-15 17:22:26,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:26,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:26,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:22:26,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:26,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325010540] [2021-12-15 17:22:26,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325010540] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:26,975 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:26,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:22:26,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817507522] [2021-12-15 17:22:26,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:27,417 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.UnsupportedOperationException: Set is immutable at de.uni_freiburg.informatik.ultimate.util.datastructures.ImmutableSet.retainAll(ImmutableSet.java:338) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.removeSuperfluousVars(UnmodifiableTransFormula.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:273) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.getTrivialTransFormula(TransFormulaBuilder.java:285) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:548) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLoopTermination(LassoCheck.java:944) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:834) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-15 17:22:27,433 INFO L158 Benchmark]: Toolchain (without parser) took 2609.40ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 76.0MB in the beginning and 89.7MB in the end (delta: -13.7MB). Peak memory consumption was 50.8MB. Max. memory is 16.1GB. [2021-12-15 17:22:27,433 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 79.7MB. Free memory was 50.8MB in the beginning and 50.8MB in the end (delta: 41.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:22:27,434 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.32ms. Allocated memory is still 98.6MB. Free memory was 75.8MB in the beginning and 60.5MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-15 17:22:27,435 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.02ms. Allocated memory is still 98.6MB. Free memory was 60.3MB in the beginning and 57.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:22:27,435 INFO L158 Benchmark]: Boogie Preprocessor took 45.84ms. Allocated memory is still 98.6MB. Free memory was 57.4MB in the beginning and 55.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:22:27,437 INFO L158 Benchmark]: RCFGBuilder took 590.20ms. Allocated memory is still 98.6MB. Free memory was 55.3MB in the beginning and 31.9MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-12-15 17:22:27,438 INFO L158 Benchmark]: BuchiAutomizer took 1680.31ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 31.6MB in the beginning and 89.7MB in the end (delta: -58.0MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2021-12-15 17:22:27,440 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.39ms. Allocated memory is still 79.7MB. Free memory was 50.8MB in the beginning and 50.8MB in the end (delta: 41.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.32ms. Allocated memory is still 98.6MB. Free memory was 75.8MB in the beginning and 60.5MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.02ms. Allocated memory is still 98.6MB. Free memory was 60.3MB in the beginning and 57.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.84ms. Allocated memory is still 98.6MB. Free memory was 57.4MB in the beginning and 55.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 590.20ms. Allocated memory is still 98.6MB. Free memory was 55.3MB in the beginning and 31.9MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * BuchiAutomizer took 1680.31ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 31.6MB in the beginning and 89.7MB in the end (delta: -58.0MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: UnsupportedOperationException: Set is immutable de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: UnsupportedOperationException: Set is immutable: de.uni_freiburg.informatik.ultimate.util.datastructures.ImmutableSet.retainAll(ImmutableSet.java:338) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-15 17:22:27,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: Set is immutable