./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.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.1.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 8b0406e617bfcdc7e6543e19b38e9be8eeb37f2896cb91bcfe6035d747328da7 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:22:18,225 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:22:18,227 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:22:18,263 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:22:18,264 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:22:18,267 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:22:18,269 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:22:18,278 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:22:18,280 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:22:18,284 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:22:18,285 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:22:18,286 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:22:18,286 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:22:18,289 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:22:18,290 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:22:18,293 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:22:18,295 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:22:18,295 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:22:18,301 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:22:18,308 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:22:18,309 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:22:18,310 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:22:18,311 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:22:18,312 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:22:18,317 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:22:18,318 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:22:18,318 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:22:18,319 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:22:18,320 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:22:18,321 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:22:18,321 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:22:18,322 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:22:18,323 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:22:18,324 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:22:18,325 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:22:18,325 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:22:18,326 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:22:18,326 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:22:18,326 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:22:18,327 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:22:18,328 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:22:18,328 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:18,360 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:22:18,361 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:22:18,361 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:22:18,361 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:22:18,363 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:22:18,363 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:22:18,363 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:22:18,363 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:22:18,363 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:22:18,363 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:22:18,364 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:22:18,364 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:22:18,365 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:22:18,365 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:22:18,365 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:22:18,365 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:22:18,365 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:22:18,365 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:22:18,366 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:22:18,367 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:22:18,367 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:22:18,371 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:22:18,371 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:22:18,371 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:22:18,372 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:22:18,373 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:22:18,373 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:22:18,373 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:22:18,373 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:22:18,373 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:22:18,374 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:22:18,374 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:22:18,375 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:22:18,375 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 -> 8b0406e617bfcdc7e6543e19b38e9be8eeb37f2896cb91bcfe6035d747328da7 [2021-12-15 17:22:18,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:22:18,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:22:18,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:22:18,670 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:22:18,672 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:22:18,673 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c [2021-12-15 17:22:18,729 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85c54697f/c0a32900df8045938bfcf22903e75931/FLAGcd7ef4146 [2021-12-15 17:22:19,155 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:22:19,156 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c [2021-12-15 17:22:19,167 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85c54697f/c0a32900df8045938bfcf22903e75931/FLAGcd7ef4146 [2021-12-15 17:22:19,182 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85c54697f/c0a32900df8045938bfcf22903e75931 [2021-12-15 17:22:19,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:22:19,199 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:22:19,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:22:19,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:22:19,203 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:22:19,204 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:22:19" (1/1) ... [2021-12-15 17:22:19,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@392ad193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:19, skipping insertion in model container [2021-12-15 17:22:19,205 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:22:19" (1/1) ... [2021-12-15 17:22:19,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:22:19,258 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:22:19,422 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.1.ufo.BOUNDED-6.pals.c[11348,11361] [2021-12-15 17:22:19,445 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:22:19,453 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:22:19,544 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.1.ufo.BOUNDED-6.pals.c[11348,11361] [2021-12-15 17:22:19,548 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:22:19,564 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:22:19,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:19 WrapperNode [2021-12-15 17:22:19,564 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:22:19,565 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:22:19,566 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:22:19,566 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:22:19,571 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:19" (1/1) ... [2021-12-15 17:22:19,591 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:19" (1/1) ... [2021-12-15 17:22:19,628 INFO L137 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 409 [2021-12-15 17:22:19,635 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:22:19,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:22:19,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:22:19,637 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:22:19,644 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:19" (1/1) ... [2021-12-15 17:22:19,644 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:19" (1/1) ... [2021-12-15 17:22:19,660 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:19" (1/1) ... [2021-12-15 17:22:19,661 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:19" (1/1) ... [2021-12-15 17:22:19,668 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:19" (1/1) ... [2021-12-15 17:22:19,689 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:19" (1/1) ... [2021-12-15 17:22:19,690 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:19" (1/1) ... [2021-12-15 17:22:19,700 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:22:19,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:22:19,702 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:22:19,702 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:22:19,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:19" (1/1) ... [2021-12-15 17:22:19,711 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:22:19,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:22:19,734 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:19,740 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:19,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:22:19,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:22:19,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:22:19,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:22:19,910 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:22:19,920 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:22:20,388 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:22:20,399 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:22:20,400 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 17:22:20,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:22:20 BoogieIcfgContainer [2021-12-15 17:22:20,403 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:22:20,404 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:22:20,404 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:22:20,410 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:22:20,411 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:20,412 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:22:19" (1/3) ... [2021-12-15 17:22:20,412 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@585d55e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:22:20, skipping insertion in model container [2021-12-15 17:22:20,413 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:20,413 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:19" (2/3) ... [2021-12-15 17:22:20,413 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@585d55e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:22:20, skipping insertion in model container [2021-12-15 17:22:20,413 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:20,413 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:22:20" (3/3) ... [2021-12-15 17:22:20,415 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.3.1.ufo.BOUNDED-6.pals.c [2021-12-15 17:22:20,455 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:22:20,455 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:22:20,455 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:22:20,455 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:22:20,455 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:22:20,456 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:22:20,456 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:22:20,456 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:22:20,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 124 states, 123 states have (on average 1.7398373983739837) internal successors, (214), 123 states have internal predecessors, (214), 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:20,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2021-12-15 17:22:20,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:20,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:20,497 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:20,498 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:20,498 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:22:20,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 124 states, 123 states have (on average 1.7398373983739837) internal successors, (214), 123 states have internal predecessors, (214), 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:20,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2021-12-15 17:22:20,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:20,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:20,513 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:20,516 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:20,523 INFO L791 eck$LassoCheckResult]: Stem: 115#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; 43#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; 93#L228true assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 48#L231-1true init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 33#L241true assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 29#L244-1true init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 58#L254true assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 62#L257-1true init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 26#L267true assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 17#L270-1true init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 101#L280true assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 79#L283-1true init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 114#L293true assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 77#L296-1true init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 123#L306true assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 111#L306-1true init_#res#1 := init_~tmp___5~0#1; 91#L391true 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; 102#L485true assume !(0 == main_~i2~0#1); 7#L485-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; 53#L499-2true [2021-12-15 17:22:20,524 INFO L793 eck$LassoCheckResult]: Loop: 53#L499-2true assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 69#L75true assume !(0 != ~mode1~0 % 256); 64#L100true assume !(~r1~0 < 2); 82#L100-1true ~mode1~0 := 1; 112#L75-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 100#L118true assume !(0 != ~mode2~0 % 256); 104#L143true assume !(~r2~0 < 2); 94#L143-1true ~mode2~0 := 1; 65#L118-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 15#L161true assume !(0 != ~mode3~0 % 256); 71#L186true assume !(~r3~0 < 2); 27#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; 75#L399true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 120#L399-1true check_#res#1 := check_~tmp~1#1; 30#L447true 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; 98#L529true assume !(0 == assert_~arg#1 % 256); 28#L524true 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; 53#L499-2true [2021-12-15 17:22:20,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:20,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1693212754, now seen corresponding path program 1 times [2021-12-15 17:22:20,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:20,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615355045] [2021-12-15 17:22:20,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:20,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:20,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:20,806 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:20,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:20,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615355045] [2021-12-15 17:22:20,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615355045] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:20,809 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:20,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:20,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151377488] [2021-12-15 17:22:20,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:20,815 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:22:20,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:20,819 INFO L85 PathProgramCache]: Analyzing trace with hash 2071749167, now seen corresponding path program 1 times [2021-12-15 17:22:20,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:20,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278297329] [2021-12-15 17:22:20,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:20,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:20,999 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:21,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:21,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278297329] [2021-12-15 17:22:21,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278297329] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:21,001 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:21,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:21,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215816432] [2021-12-15 17:22:21,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:21,003 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:21,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:21,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:22:21,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:22:21,044 INFO L87 Difference]: Start difference. First operand has 124 states, 123 states have (on average 1.7398373983739837) internal successors, (214), 123 states have internal predecessors, (214), 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:21,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:21,139 INFO L93 Difference]: Finished difference Result 128 states and 214 transitions. [2021-12-15 17:22:21,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:22:21,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 214 transitions. [2021-12-15 17:22:21,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2021-12-15 17:22:21,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 119 states and 198 transitions. [2021-12-15 17:22:21,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2021-12-15 17:22:21,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2021-12-15 17:22:21,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 198 transitions. [2021-12-15 17:22:21,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:21,170 INFO L681 BuchiCegarLoop]: Abstraction has 119 states and 198 transitions. [2021-12-15 17:22:21,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 198 transitions. [2021-12-15 17:22:21,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-12-15 17:22:21,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 119 states have (on average 1.6638655462184875) internal successors, (198), 118 states have internal predecessors, (198), 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:21,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 198 transitions. [2021-12-15 17:22:21,207 INFO L704 BuchiCegarLoop]: Abstraction has 119 states and 198 transitions. [2021-12-15 17:22:21,207 INFO L587 BuchiCegarLoop]: Abstraction has 119 states and 198 transitions. [2021-12-15 17:22:21,208 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:22:21,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 198 transitions. [2021-12-15 17:22:21,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2021-12-15 17:22:21,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:21,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:21,212 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:21,213 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:21,213 INFO L791 eck$LassoCheckResult]: Stem: 387#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; 338#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; 339#L228 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 345#L231-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 325#L241 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 285#L244-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 323#L254 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 333#L257-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 318#L267 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 291#L270-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 302#L280 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 365#L283-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 371#L293 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 335#L296-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 370#L306 assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 272#L306-1 init_#res#1 := init_~tmp___5~0#1; 379#L391 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; 380#L485 assume !(0 == main_~i2~0#1); 277#L485-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; 278#L499-2 [2021-12-15 17:22:21,213 INFO L793 eck$LassoCheckResult]: Loop: 278#L499-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 352#L75 assume !(0 != ~mode1~0 % 256); 360#L100 assume !(~r1~0 < 2); 340#L100-1 ~mode1~0 := 1; 315#L75-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 381#L118 assume !(0 != ~mode2~0 % 256); 382#L143 assume !(~r2~0 < 2); 336#L143-1 ~mode2~0 := 1; 362#L118-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 296#L161 assume !(0 != ~mode3~0 % 256); 297#L186 assume !(~r3~0 < 2); 319#L186-1 ~mode3~0 := 1; 275#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; 276#L399 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 369#L400 assume ~st1~0 + ~nl1~0 <= 1; 287#L401 assume ~st2~0 + ~nl2~0 <= 1; 288#L402 assume ~st3~0 + ~nl3~0 <= 1; 355#L403 assume ~r1~0 >= 2; 299#L407 assume ~r1~0 < 2; 300#L412 assume ~r1~0 >= 2; 306#L417 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 327#L399-1 check_#res#1 := check_~tmp~1#1; 321#L447 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; 322#L529 assume !(0 == assert_~arg#1 % 256); 320#L524 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; 278#L499-2 [2021-12-15 17:22:21,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:21,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1693212754, now seen corresponding path program 2 times [2021-12-15 17:22:21,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:21,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163679178] [2021-12-15 17:22:21,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:21,215 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:21,287 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:21,288 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:21,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163679178] [2021-12-15 17:22:21,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163679178] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:21,290 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:21,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:21,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236556265] [2021-12-15 17:22:21,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:21,292 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:22:21,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:21,293 INFO L85 PathProgramCache]: Analyzing trace with hash -980587296, now seen corresponding path program 1 times [2021-12-15 17:22:21,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:21,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857233783] [2021-12-15 17:22:21,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:21,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:21,341 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:21,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:21,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857233783] [2021-12-15 17:22:21,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857233783] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:21,343 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:21,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:22:21,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134333116] [2021-12-15 17:22:21,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:21,345 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:21,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:21,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:22:21,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:22:21,346 INFO L87 Difference]: Start difference. First operand 119 states and 198 transitions. cyclomatic complexity: 80 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:21,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:21,420 INFO L93 Difference]: Finished difference Result 190 states and 308 transitions. [2021-12-15 17:22:21,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 17:22:21,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 190 states and 308 transitions. [2021-12-15 17:22:21,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2021-12-15 17:22:21,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 190 states to 187 states and 285 transitions. [2021-12-15 17:22:21,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 187 [2021-12-15 17:22:21,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 187 [2021-12-15 17:22:21,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 187 states and 285 transitions. [2021-12-15 17:22:21,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:21,430 INFO L681 BuchiCegarLoop]: Abstraction has 187 states and 285 transitions. [2021-12-15 17:22:21,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states and 285 transitions. [2021-12-15 17:22:21,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 119. [2021-12-15 17:22:21,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 119 states have (on average 1.4873949579831933) internal successors, (177), 118 states have internal predecessors, (177), 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:21,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 177 transitions. [2021-12-15 17:22:21,436 INFO L704 BuchiCegarLoop]: Abstraction has 119 states and 177 transitions. [2021-12-15 17:22:21,436 INFO L587 BuchiCegarLoop]: Abstraction has 119 states and 177 transitions. [2021-12-15 17:22:21,436 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:22:21,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 177 transitions. [2021-12-15 17:22:21,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2021-12-15 17:22:21,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:21,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:21,438 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] [2021-12-15 17:22:21,438 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:21,439 INFO L791 eck$LassoCheckResult]: Stem: 709#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; 660#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; 661#L228 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 667#L231-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 647#L241 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 608#L244-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 644#L254 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 655#L257-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 639#L267 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 612#L270-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 623#L280 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 687#L283-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 694#L293 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 657#L296-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 692#L306 assume ~id1~0 != ~id2~0; 696#L307 assume ~id1~0 != ~id3~0; 615#L308 assume ~id2~0 != ~id3~0; 616#L309 assume ~id1~0 >= 0; 695#L310 assume ~id2~0 >= 0; 672#L311 assume ~id3~0 >= 0; 673#L312 assume 0 == ~r1~0; 637#L313 assume 0 == ~r2~0; 638#L314 assume 0 == ~r3~0; 665#L315 assume ~max1~0 == ~id1~0; 666#L316 assume ~max2~0 == ~id2~0; 594#L317 assume ~max3~0 == ~id3~0; 595#L318 assume 0 == ~st1~0; 710#L319 assume 0 == ~st2~0; 700#L320 assume 0 == ~st3~0; 689#L321 assume 0 == ~nl1~0; 690#L322 assume 0 == ~nl2~0; 592#L323 assume 0 == ~nl3~0; 593#L324 assume 0 == ~mode1~0 % 256; 624#L325 assume 0 == ~mode2~0 % 256; 645#L326 assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; 646#L306-1 init_#res#1 := init_~tmp___5~0#1; 701#L391 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; 702#L485 assume !(0 == main_~i2~0#1); 598#L485-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; 599#L499-2 [2021-12-15 17:22:21,439 INFO L793 eck$LassoCheckResult]: Loop: 599#L499-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 674#L75 assume !(0 != ~mode1~0 % 256); 682#L100 assume !(~r1~0 < 2); 662#L100-1 ~mode1~0 := 1; 636#L75-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 703#L118 assume !(0 != ~mode2~0 % 256); 704#L143 assume !(~r2~0 < 2); 658#L143-1 ~mode2~0 := 1; 684#L118-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 617#L161 assume !(0 != ~mode3~0 % 256); 618#L186 assume !(~r3~0 < 2); 640#L186-1 ~mode3~0 := 1; 596#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; 597#L399 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 691#L400 assume ~st1~0 + ~nl1~0 <= 1; 605#L401 assume ~st2~0 + ~nl2~0 <= 1; 606#L402 assume ~st3~0 + ~nl3~0 <= 1; 677#L403 assume ~r1~0 >= 2; 620#L407 assume ~r1~0 < 2; 621#L412 assume ~r1~0 >= 2; 627#L417 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 649#L399-1 check_#res#1 := check_~tmp~1#1; 642#L447 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; 643#L529 assume !(0 == assert_~arg#1 % 256); 641#L524 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; 599#L499-2 [2021-12-15 17:22:21,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:21,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1849055478, now seen corresponding path program 1 times [2021-12-15 17:22:21,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:21,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252667121] [2021-12-15 17:22:21,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:21,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:21,461 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:21,503 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:21,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:21,504 INFO L85 PathProgramCache]: Analyzing trace with hash -980587296, now seen corresponding path program 2 times [2021-12-15 17:22:21,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:21,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118920638] [2021-12-15 17:22:21,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:21,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:21,545 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:21,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:21,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118920638] [2021-12-15 17:22:21,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118920638] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:21,546 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:21,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:22:21,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604709383] [2021-12-15 17:22:21,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:21,547 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:21,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:21,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:22:21,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:22:21,548 INFO L87 Difference]: Start difference. First operand 119 states and 177 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:21,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:21,577 INFO L93 Difference]: Finished difference Result 171 states and 254 transitions. [2021-12-15 17:22:21,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:22:21,578 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 171 states and 254 transitions. [2021-12-15 17:22:21,579 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 120 [2021-12-15 17:22:21,581 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 171 states to 171 states and 254 transitions. [2021-12-15 17:22:21,581 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 171 [2021-12-15 17:22:21,581 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 171 [2021-12-15 17:22:21,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 254 transitions. [2021-12-15 17:22:21,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:21,582 INFO L681 BuchiCegarLoop]: Abstraction has 171 states and 254 transitions. [2021-12-15 17:22:21,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 254 transitions. [2021-12-15 17:22:21,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2021-12-15 17:22:21,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 171 states have (on average 1.4853801169590644) internal successors, (254), 170 states have internal predecessors, (254), 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:21,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 254 transitions. [2021-12-15 17:22:21,589 INFO L704 BuchiCegarLoop]: Abstraction has 171 states and 254 transitions. [2021-12-15 17:22:21,589 INFO L587 BuchiCegarLoop]: Abstraction has 171 states and 254 transitions. [2021-12-15 17:22:21,589 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:22:21,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 171 states and 254 transitions. [2021-12-15 17:22:21,590 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 120 [2021-12-15 17:22:21,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:21,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:21,592 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] [2021-12-15 17:22:21,592 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] [2021-12-15 17:22:21,592 INFO L791 eck$LassoCheckResult]: Stem: 1016#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; 959#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; 960#L228 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 966#L231-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 944#L241 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 904#L244-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 941#L254 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 952#L257-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 935#L267 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 908#L270-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 918#L280 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 988#L283-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 996#L293 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 954#L296-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 994#L306 assume ~id1~0 != ~id2~0; 998#L307 assume ~id1~0 != ~id3~0; 911#L308 assume ~id2~0 != ~id3~0; 912#L309 assume ~id1~0 >= 0; 997#L310 assume ~id2~0 >= 0; 971#L311 assume ~id3~0 >= 0; 972#L312 assume 0 == ~r1~0; 933#L313 assume 0 == ~r2~0; 934#L314 assume 0 == ~r3~0; 964#L315 assume ~max1~0 == ~id1~0; 965#L316 assume ~max2~0 == ~id2~0; 890#L317 assume ~max3~0 == ~id3~0; 891#L318 assume 0 == ~st1~0; 1019#L319 assume 0 == ~st2~0; 1002#L320 assume 0 == ~st3~0; 991#L321 assume 0 == ~nl1~0; 992#L322 assume 0 == ~nl2~0; 888#L323 assume 0 == ~nl3~0; 889#L324 assume 0 == ~mode1~0 % 256; 919#L325 assume 0 == ~mode2~0 % 256; 942#L326 assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; 943#L306-1 init_#res#1 := init_~tmp___5~0#1; 1003#L391 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; 1004#L485 assume !(0 == main_~i2~0#1); 894#L485-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; 895#L499-2 [2021-12-15 17:22:21,592 INFO L793 eck$LassoCheckResult]: Loop: 895#L499-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 1048#L75 assume !(0 != ~mode1~0 % 256); 1047#L100 assume ~r1~0 < 2; 1017#L101 assume !(0 != ~ep12~0 % 256); 963#L101-2 assume !(0 != ~ep13~0 % 256); 961#L100-1 ~mode1~0 := 1; 932#L75-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 1046#L118 assume !(0 != ~mode2~0 % 256); 1010#L143 assume !(~r2~0 < 2); 955#L143-1 ~mode2~0 := 1; 1033#L118-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 1031#L161 assume !(0 != ~mode3~0 % 256); 1028#L186 assume !(~r3~0 < 2); 936#L186-1 ~mode3~0 := 1; 892#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; 893#L399 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 993#L400 assume ~st1~0 + ~nl1~0 <= 1; 901#L401 assume ~st2~0 + ~nl2~0 <= 1; 902#L402 assume ~st3~0 + ~nl3~0 <= 1; 1021#L403 assume !(~r1~0 >= 2); 956#L406 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 957#L407 assume ~r1~0 < 2; 1020#L412 assume !(~r1~0 >= 2); 922#L416 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 923#L417 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 1052#L399-1 check_#res#1 := check_~tmp~1#1; 1051#L447 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; 1050#L529 assume !(0 == assert_~arg#1 % 256); 1049#L524 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; 895#L499-2 [2021-12-15 17:22:21,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:21,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1849055478, now seen corresponding path program 2 times [2021-12-15 17:22:21,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:21,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696144453] [2021-12-15 17:22:21,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:21,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:21,611 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:21,635 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:21,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:21,637 INFO L85 PathProgramCache]: Analyzing trace with hash 365017361, now seen corresponding path program 1 times [2021-12-15 17:22:21,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:21,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886502657] [2021-12-15 17:22:21,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:21,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:21,646 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:21,654 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:21,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:21,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1685413828, now seen corresponding path program 1 times [2021-12-15 17:22:21,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:21,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909686470] [2021-12-15 17:22:21,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:21,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:21,719 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:21,719 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:21,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909686470] [2021-12-15 17:22:21,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909686470] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:21,721 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:21,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:22:21,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473221156] [2021-12-15 17:22:21,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:22,358 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:22,365 INFO L158 Benchmark]: Toolchain (without parser) took 3165.67ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 80.3MB in the beginning and 85.2MB in the end (delta: -4.9MB). Peak memory consumption was 61.3MB. Max. memory is 16.1GB. [2021-12-15 17:22:22,365 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 77.6MB. Free memory was 50.3MB in the beginning and 50.3MB in the end (delta: 59.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:22:22,366 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.74ms. Allocated memory is still 100.7MB. Free memory was 80.1MB in the beginning and 76.4MB in the end (delta: 3.8MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2021-12-15 17:22:22,366 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.14ms. Allocated memory is still 100.7MB. Free memory was 76.4MB in the beginning and 73.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:22:22,367 INFO L158 Benchmark]: Boogie Preprocessor took 64.45ms. Allocated memory is still 100.7MB. Free memory was 73.7MB in the beginning and 71.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:22:22,367 INFO L158 Benchmark]: RCFGBuilder took 701.75ms. Allocated memory is still 100.7MB. Free memory was 71.6MB in the beginning and 49.1MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-12-15 17:22:22,368 INFO L158 Benchmark]: BuchiAutomizer took 1959.72ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 49.1MB in the beginning and 85.2MB in the end (delta: -36.1MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. [2021-12-15 17:22:22,370 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.19ms. Allocated memory is still 77.6MB. Free memory was 50.3MB in the beginning and 50.3MB in the end (delta: 59.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 364.74ms. Allocated memory is still 100.7MB. Free memory was 80.1MB in the beginning and 76.4MB in the end (delta: 3.8MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.14ms. Allocated memory is still 100.7MB. Free memory was 76.4MB in the beginning and 73.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.45ms. Allocated memory is still 100.7MB. Free memory was 73.7MB in the beginning and 71.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 701.75ms. Allocated memory is still 100.7MB. Free memory was 71.6MB in the beginning and 49.1MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * BuchiAutomizer took 1959.72ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 49.1MB in the beginning and 85.2MB in the end (delta: -36.1MB). Peak memory consumption was 32.5MB. 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:22,409 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