./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8faf2a9-6258-467b-8642-a52379a12733/bin/ukojak-LBtLqBUTdQ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8faf2a9-6258-467b-8642-a52379a12733/bin/ukojak-LBtLqBUTdQ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8faf2a9-6258-467b-8642-a52379a12733/bin/ukojak-LBtLqBUTdQ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8faf2a9-6258-467b-8642-a52379a12733/bin/ukojak-LBtLqBUTdQ/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8faf2a9-6258-467b-8642-a52379a12733/bin/ukojak-LBtLqBUTdQ/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8faf2a9-6258-467b-8642-a52379a12733/bin/ukojak-LBtLqBUTdQ --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7a355896b8b65b5a2cb80c69f28000f566073d33b0003da7d28a637c6d5db6a --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-22 23:09:12,268 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 23:09:12,272 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 23:09:12,340 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 23:09:12,341 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 23:09:12,348 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 23:09:12,350 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 23:09:12,356 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 23:09:12,359 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 23:09:12,366 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 23:09:12,367 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 23:09:12,369 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 23:09:12,370 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 23:09:12,373 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 23:09:12,376 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 23:09:12,383 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 23:09:12,385 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 23:09:12,387 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 23:09:12,389 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 23:09:12,397 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 23:09:12,400 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 23:09:12,402 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 23:09:12,404 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 23:09:12,405 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 23:09:12,409 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 23:09:12,410 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 23:09:12,410 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 23:09:12,411 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 23:09:12,412 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 23:09:12,414 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 23:09:12,414 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 23:09:12,415 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 23:09:12,416 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 23:09:12,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 23:09:12,419 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 23:09:12,419 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 23:09:12,420 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 23:09:12,420 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 23:09:12,421 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 23:09:12,422 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 23:09:12,423 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 23:09:12,424 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8faf2a9-6258-467b-8642-a52379a12733/bin/ukojak-LBtLqBUTdQ/config/svcomp-Reach-32bit-Kojak_Default.epf [2021-11-22 23:09:12,463 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 23:09:12,463 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 23:09:12,464 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-22 23:09:12,464 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2021-11-22 23:09:12,465 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 23:09:12,465 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 23:09:12,466 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 23:09:12,466 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-22 23:09:12,466 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 23:09:12,466 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-22 23:09:12,467 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 23:09:12,467 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 23:09:12,467 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 23:09:12,467 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 23:09:12,467 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-22 23:09:12,468 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 23:09:12,468 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 23:09:12,468 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 23:09:12,468 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2021-11-22 23:09:12,468 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2021-11-22 23:09:12,469 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 23:09:12,469 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-22 23:09:12,469 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 23:09:12,469 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 23:09:12,470 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 23:09:12,470 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2021-11-22 23:09:12,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-22 23:09:12,470 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 23:09:12,470 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8faf2a9-6258-467b-8642-a52379a12733/bin/ukojak-LBtLqBUTdQ/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8faf2a9-6258-467b-8642-a52379a12733/bin/ukojak-LBtLqBUTdQ 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(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak 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 -> b7a355896b8b65b5a2cb80c69f28000f566073d33b0003da7d28a637c6d5db6a [2021-11-22 23:09:12,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 23:09:12,877 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 23:09:12,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 23:09:12,883 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 23:09:12,885 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 23:09:12,887 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8faf2a9-6258-467b-8642-a52379a12733/bin/ukojak-LBtLqBUTdQ/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c [2021-11-22 23:09:12,966 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8faf2a9-6258-467b-8642-a52379a12733/bin/ukojak-LBtLqBUTdQ/data/840f407e1/efb1b80aa1a54e12a3cfa87578ea6f73/FLAGe3b771db3 [2021-11-22 23:09:13,570 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 23:09:13,571 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8faf2a9-6258-467b-8642-a52379a12733/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c [2021-11-22 23:09:13,584 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8faf2a9-6258-467b-8642-a52379a12733/bin/ukojak-LBtLqBUTdQ/data/840f407e1/efb1b80aa1a54e12a3cfa87578ea6f73/FLAGe3b771db3 [2021-11-22 23:09:13,861 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8faf2a9-6258-467b-8642-a52379a12733/bin/ukojak-LBtLqBUTdQ/data/840f407e1/efb1b80aa1a54e12a3cfa87578ea6f73 [2021-11-22 23:09:13,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 23:09:13,866 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 23:09:13,868 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 23:09:13,868 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 23:09:13,876 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 23:09:13,877 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:09:13" (1/1) ... [2021-11-22 23:09:13,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@480950a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:09:13, skipping insertion in model container [2021-11-22 23:09:13,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:09:13" (1/1) ... [2021-11-22 23:09:13,892 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 23:09:13,949 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 23:09:14,289 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8faf2a9-6258-467b-8642-a52379a12733/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c[12968,12981] [2021-11-22 23:09:14,293 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 23:09:14,306 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 23:09:14,385 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8faf2a9-6258-467b-8642-a52379a12733/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c[12968,12981] [2021-11-22 23:09:14,386 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 23:09:14,418 INFO L208 MainTranslator]: Completed translation [2021-11-22 23:09:14,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:09:14 WrapperNode [2021-11-22 23:09:14,422 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 23:09:14,424 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 23:09:14,424 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 23:09:14,424 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 23:09:14,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:09:14" (1/1) ... [2021-11-22 23:09:14,447 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:09:14" (1/1) ... [2021-11-22 23:09:14,503 INFO L137 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 443 [2021-11-22 23:09:14,504 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 23:09:14,505 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 23:09:14,505 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 23:09:14,505 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 23:09:14,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:09:14" (1/1) ... [2021-11-22 23:09:14,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:09:14" (1/1) ... [2021-11-22 23:09:14,521 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:09:14" (1/1) ... [2021-11-22 23:09:14,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:09:14" (1/1) ... [2021-11-22 23:09:14,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:09:14" (1/1) ... [2021-11-22 23:09:14,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:09:14" (1/1) ... [2021-11-22 23:09:14,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:09:14" (1/1) ... [2021-11-22 23:09:14,601 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 23:09:14,602 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 23:09:14,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 23:09:14,603 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 23:09:14,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:09:14" (1/1) ... [2021-11-22 23:09:14,618 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-22 23:09:14,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8faf2a9-6258-467b-8642-a52379a12733/bin/ukojak-LBtLqBUTdQ/z3 [2021-11-22 23:09:14,656 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8faf2a9-6258-467b-8642-a52379a12733/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2021-11-22 23:09:14,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8faf2a9-6258-467b-8642-a52379a12733/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2021-11-22 23:09:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 23:09:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 23:09:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 23:09:14,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 23:09:14,861 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 23:09:14,864 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 23:09:15,623 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 23:09:16,446 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 23:09:16,446 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-22 23:09:16,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:09:16 BoogieIcfgContainer [2021-11-22 23:09:16,449 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 23:09:16,451 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2021-11-22 23:09:16,451 INFO L271 PluginConnector]: Initializing CodeCheck... [2021-11-22 23:09:16,464 INFO L275 PluginConnector]: CodeCheck initialized [2021-11-22 23:09:16,465 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:09:16" (1/1) ... [2021-11-22 23:09:16,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 23:09:16,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:09:16,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2021-11-22 23:09:16,588 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2021-11-22 23:09:16,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-22 23:09:16,591 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:09:16,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:09:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:09:17,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:09:17,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:09:17,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2021-11-22 23:09:17,755 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2021-11-22 23:09:17,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-22 23:09:17,756 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:09:17,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:09:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:09:18,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:09:18,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:09:18,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 23 states and 38 transitions. [2021-11-22 23:09:18,529 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2021-11-22 23:09:18,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-22 23:09:18,529 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:09:18,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:09:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:09:18,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:09:19,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:09:19,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 27 states and 46 transitions. [2021-11-22 23:09:19,418 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2021-11-22 23:09:19,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-22 23:09:19,421 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:09:19,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:09:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:09:19,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:09:20,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:09:20,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 32 states and 56 transitions. [2021-11-22 23:09:20,504 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2021-11-22 23:09:20,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-22 23:09:20,504 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:09:20,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:09:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:09:20,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:09:21,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:09:21,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 39 states and 68 transitions. [2021-11-22 23:09:21,965 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 68 transitions. [2021-11-22 23:09:21,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-22 23:09:21,966 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:09:21,966 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:09:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:09:22,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:09:23,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:09:23,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 45 states and 79 transitions. [2021-11-22 23:09:23,438 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 79 transitions. [2021-11-22 23:09:23,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-22 23:09:23,441 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:09:23,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:09:23,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:09:23,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:09:23,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:09:23,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2021-11-22 23:09:23,804 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2021-11-22 23:09:23,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-22 23:09:23,804 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:09:23,805 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:09:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:09:23,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:09:23,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:09:23,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 47 states and 80 transitions. [2021-11-22 23:09:23,880 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2021-11-22 23:09:23,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-22 23:09:23,881 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:09:23,881 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:09:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:09:24,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:09:26,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:09:26,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 57 states and 96 transitions. [2021-11-22 23:09:26,097 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 96 transitions. [2021-11-22 23:09:26,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-22 23:09:26,098 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:09:26,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:09:26,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:09:26,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:09:26,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:09:26,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 60 states and 101 transitions. [2021-11-22 23:09:26,566 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 101 transitions. [2021-11-22 23:09:26,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-22 23:09:26,567 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:09:26,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:09:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:09:27,442 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:09:31,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:09:31,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 76 states and 130 transitions. [2021-11-22 23:09:31,774 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 130 transitions. [2021-11-22 23:09:31,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-22 23:09:31,776 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:09:31,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:09:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:09:32,688 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:09:37,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:09:37,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 89 states and 154 transitions. [2021-11-22 23:09:37,208 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 154 transitions. [2021-11-22 23:09:37,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-22 23:09:37,210 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:09:37,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:09:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:09:38,119 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:09:43,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:09:43,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 104 states and 183 transitions. [2021-11-22 23:09:43,037 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 183 transitions. [2021-11-22 23:09:43,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-22 23:09:43,039 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:09:43,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:09:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:09:43,375 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:09:44,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:09:44,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 106 states and 189 transitions. [2021-11-22 23:09:44,212 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 189 transitions. [2021-11-22 23:09:44,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-22 23:09:44,215 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:09:44,216 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:09:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:09:45,193 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:09:49,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:09:49,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 120 states and 213 transitions. [2021-11-22 23:09:49,113 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 213 transitions. [2021-11-22 23:09:49,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-22 23:09:49,115 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:09:49,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:09:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:09:49,408 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:09:50,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:09:50,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 122 states and 221 transitions. [2021-11-22 23:09:50,255 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 221 transitions. [2021-11-22 23:09:50,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-22 23:09:50,256 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:09:50,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:09:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:09:50,624 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:09:51,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:09:51,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 123 states and 222 transitions. [2021-11-22 23:09:51,069 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 222 transitions. [2021-11-22 23:09:51,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-22 23:09:51,075 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:09:51,075 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:09:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:09:52,113 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:09:58,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:09:58,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 140 states and 254 transitions. [2021-11-22 23:09:58,659 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 254 transitions. [2021-11-22 23:09:58,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-22 23:09:58,660 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:09:58,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:09:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:09:59,038 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:10:00,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:10:00,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 143 states and 264 transitions. [2021-11-22 23:10:00,787 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 264 transitions. [2021-11-22 23:10:00,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-22 23:10:00,788 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:10:00,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:10:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:10:01,147 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:10:01,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:10:01,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 144 states and 265 transitions. [2021-11-22 23:10:01,638 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 265 transitions. [2021-11-22 23:10:01,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-22 23:10:01,639 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:10:01,639 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:10:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:10:01,968 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:10:02,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:10:02,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 145 states and 266 transitions. [2021-11-22 23:10:02,477 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 266 transitions. [2021-11-22 23:10:02,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-22 23:10:02,478 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:10:02,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:10:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:10:03,151 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:10:04,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:10:04,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 150 states and 275 transitions. [2021-11-22 23:10:04,718 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 275 transitions. [2021-11-22 23:10:04,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-22 23:10:04,719 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:10:04,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:10:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:10:05,072 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:10:06,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:10:06,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 153 states and 281 transitions. [2021-11-22 23:10:06,468 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 281 transitions. [2021-11-22 23:10:06,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-22 23:10:06,469 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:10:06,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:10:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:10:06,828 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:10:08,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:10:08,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 157 states and 287 transitions. [2021-11-22 23:10:08,576 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 287 transitions. [2021-11-22 23:10:08,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-22 23:10:08,576 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:10:08,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:10:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:10:09,995 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:10:15,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:10:15,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 165 states and 305 transitions. [2021-11-22 23:10:15,160 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 305 transitions. [2021-11-22 23:10:15,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-22 23:10:15,161 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:10:15,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:10:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:10:15,698 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:10:17,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:10:17,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 169 states and 315 transitions. [2021-11-22 23:10:17,713 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 315 transitions. [2021-11-22 23:10:17,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-22 23:10:17,714 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:10:17,714 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:10:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:10:18,247 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:10:19,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:10:19,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 171 states and 322 transitions. [2021-11-22 23:10:19,158 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 322 transitions. [2021-11-22 23:10:19,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-22 23:10:19,159 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:10:19,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:10:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:10:19,648 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:10:20,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:10:20,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 172 states and 323 transitions. [2021-11-22 23:10:20,249 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 323 transitions. [2021-11-22 23:10:20,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-22 23:10:20,250 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:10:20,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:10:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:10:21,972 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:10:36,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:10:36,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 201 states and 398 transitions. [2021-11-22 23:10:36,537 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 398 transitions. [2021-11-22 23:10:36,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-22 23:10:36,538 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:10:36,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:10:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:10:37,102 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:10:39,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:10:39,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 205 states and 409 transitions. [2021-11-22 23:10:39,791 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 409 transitions. [2021-11-22 23:10:39,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-22 23:10:39,793 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:10:39,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:10:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:10:40,247 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:10:42,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:10:42,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 209 states and 418 transitions. [2021-11-22 23:10:42,801 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 418 transitions. [2021-11-22 23:10:42,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-22 23:10:42,802 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:10:42,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:10:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:10:43,274 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:10:44,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:10:44,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 210 states and 419 transitions. [2021-11-22 23:10:44,306 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 419 transitions. [2021-11-22 23:10:44,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-22 23:10:44,307 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:10:44,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:10:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:10:44,770 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:10:45,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:10:45,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 211 states and 420 transitions. [2021-11-22 23:10:45,644 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 420 transitions. [2021-11-22 23:10:45,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-22 23:10:45,646 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:10:45,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:10:45,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:10:47,171 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-22 23:11:01,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:11:01,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 241 states and 488 transitions. [2021-11-22 23:11:01,586 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 488 transitions. [2021-11-22 23:11:01,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-22 23:11:01,588 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:11:01,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:11:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:11:01,934 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-22 23:11:05,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:11:05,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 246 states and 500 transitions. [2021-11-22 23:11:05,078 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 500 transitions. [2021-11-22 23:11:05,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-22 23:11:05,080 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:11:05,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:11:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:11:05,479 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-22 23:11:06,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:11:06,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 247 states and 501 transitions. [2021-11-22 23:11:06,503 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 501 transitions. [2021-11-22 23:11:06,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-22 23:11:06,507 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:11:06,507 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:11:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:11:08,203 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:11:16,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:11:16,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 261 states and 532 transitions. [2021-11-22 23:11:16,699 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 532 transitions. [2021-11-22 23:11:16,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-22 23:11:16,700 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:11:16,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:11:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:11:17,066 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:11:18,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:11:18,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 264 states and 538 transitions. [2021-11-22 23:11:18,347 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 538 transitions. [2021-11-22 23:11:18,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-22 23:11:18,348 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:11:18,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:11:18,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:11:18,696 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:11:19,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:11:19,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 265 states and 545 transitions. [2021-11-22 23:11:19,843 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 545 transitions. [2021-11-22 23:11:19,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-22 23:11:19,844 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:11:19,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:11:20,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:11:20,255 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:11:21,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:11:21,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 267 states and 548 transitions. [2021-11-22 23:11:21,904 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 548 transitions. [2021-11-22 23:11:21,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-22 23:11:21,906 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:11:21,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:11:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:11:22,247 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:11:23,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:11:23,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 268 states and 549 transitions. [2021-11-22 23:11:23,106 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 549 transitions. [2021-11-22 23:11:23,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-22 23:11:23,107 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:11:23,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:11:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:11:25,669 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:11:35,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:11:35,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 279 states and 575 transitions. [2021-11-22 23:11:35,289 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 575 transitions. [2021-11-22 23:11:35,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-22 23:11:35,290 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:11:35,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:11:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:11:35,860 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:11:38,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:11:38,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 275 states and 575 transitions. [2021-11-22 23:11:38,174 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 575 transitions. [2021-11-22 23:11:38,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-22 23:11:38,175 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:11:38,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:11:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:11:41,159 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:11:48,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:11:48,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 281 states and 594 transitions. [2021-11-22 23:11:48,746 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 594 transitions. [2021-11-22 23:11:48,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-22 23:11:48,747 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:11:48,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:11:49,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:11:49,233 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:11:50,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:11:50,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 282 states and 598 transitions. [2021-11-22 23:11:50,536 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 598 transitions. [2021-11-22 23:11:50,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-22 23:11:50,537 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:11:50,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:11:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:11:51,954 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:11:56,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:11:56,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 288 states and 613 transitions. [2021-11-22 23:11:56,931 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 613 transitions. [2021-11-22 23:11:56,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-22 23:11:56,932 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:11:56,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:11:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:11:57,198 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:11:58,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:11:58,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 289 states and 614 transitions. [2021-11-22 23:11:58,119 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 614 transitions. [2021-11-22 23:11:58,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-22 23:11:58,120 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:11:58,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:11:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:11:58,471 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:11:59,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:11:59,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 290 states and 619 transitions. [2021-11-22 23:11:59,548 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 619 transitions. [2021-11-22 23:11:59,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-22 23:11:59,549 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:11:59,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:11:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:12:01,020 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:12:06,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:12:06,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 295 states and 635 transitions. [2021-11-22 23:12:06,497 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 635 transitions. [2021-11-22 23:12:06,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-22 23:12:06,497 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:12:06,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:12:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:12:07,613 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:12:08,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:12:08,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 296 states and 637 transitions. [2021-11-22 23:12:08,725 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 637 transitions. [2021-11-22 23:12:08,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-22 23:12:08,726 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:12:08,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:12:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:12:09,972 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:12:11,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:12:11,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 297 states and 638 transitions. [2021-11-22 23:12:11,255 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 638 transitions. [2021-11-22 23:12:11,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-22 23:12:11,256 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:12:11,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:12:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 23:12:12,250 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 23:12:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 23:12:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 23:12:13,864 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 23:12:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 23:12:14,589 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 52 iterations. [2021-11-22 23:12:14,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 22.11 11:12:14 ImpRootNode [2021-11-22 23:12:14,873 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2021-11-22 23:12:14,874 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-22 23:12:14,874 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-22 23:12:14,874 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-22 23:12:14,875 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:09:16" (3/4) ... [2021-11-22 23:12:14,877 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-22 23:12:15,120 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8faf2a9-6258-467b-8642-a52379a12733/bin/ukojak-LBtLqBUTdQ/witness.graphml [2021-11-22 23:12:15,120 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-22 23:12:15,121 INFO L158 Benchmark]: Toolchain (without parser) took 181255.17ms. Allocated memory was 121.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 83.8MB in the beginning and 605.9MB in the end (delta: -522.1MB). Peak memory consumption was 849.9MB. Max. memory is 16.1GB. [2021-11-22 23:12:15,122 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 121.6MB. Free memory is still 100.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 23:12:15,123 INFO L158 Benchmark]: CACSL2BoogieTranslator took 554.56ms. Allocated memory is still 121.6MB. Free memory was 83.7MB in the beginning and 90.8MB in the end (delta: -7.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-22 23:12:15,123 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.19ms. Allocated memory is still 121.6MB. Free memory was 90.8MB in the beginning and 88.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-22 23:12:15,124 INFO L158 Benchmark]: Boogie Preprocessor took 96.83ms. Allocated memory is still 121.6MB. Free memory was 88.1MB in the beginning and 85.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-22 23:12:15,124 INFO L158 Benchmark]: RCFGBuilder took 1847.30ms. Allocated memory was 121.6MB in the beginning and 151.0MB in the end (delta: 29.4MB). Free memory was 85.6MB in the beginning and 104.5MB in the end (delta: -18.8MB). Peak memory consumption was 53.5MB. Max. memory is 16.1GB. [2021-11-22 23:12:15,125 INFO L158 Benchmark]: CodeCheck took 178422.52ms. Allocated memory was 151.0MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 104.5MB in the beginning and 625.9MB in the end (delta: -521.4MB). Peak memory consumption was 819.7MB. Max. memory is 16.1GB. [2021-11-22 23:12:15,125 INFO L158 Benchmark]: Witness Printer took 246.15ms. Allocated memory is still 1.5GB. Free memory was 625.9MB in the beginning and 605.9MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-11-22 23:12:15,128 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 178.1s, OverallIterations: 52, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20737 SdHoareTripleChecker+Valid, 169.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19014 mSDsluCounter, 5122 SdHoareTripleChecker+Invalid, 151.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4293 mSDsCounter, 5618 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 53269 IncrementalHoareTripleChecker+Invalid, 58887 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5618 mSolverCounterUnsat, 829 mSDtfsCounter, 53269 mSolverCounterSat, 0.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14690 GetRequests, 12967 SyntacticMatches, 769 SemanticMatches, 954 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544842 ImplicationChecksByTransitivity, 147.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 12.2s SatisfiabilityAnalysisTime, 23.9s InterpolantComputationTime, 1454 NumberOfCodeBlocks, 1454 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 1355 ConstructedInterpolants, 0 QuantifiedInterpolants, 22175 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 51 InterpolantComputations, 10 PerfectInterpolantSequences, 167/795 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 567]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] msg_t nomsg = (msg_t )-1; [L29] port_t p12 ; [L30] char p12_old ; [L31] char p12_new ; [L32] _Bool ep12 ; [L33] port_t p13 ; [L34] char p13_old ; [L35] char p13_new ; [L36] _Bool ep13 ; [L37] port_t p21 ; [L38] char p21_old ; [L39] char p21_new ; [L40] _Bool ep21 ; [L41] port_t p23 ; [L42] char p23_old ; [L43] char p23_new ; [L44] _Bool ep23 ; [L45] port_t p31 ; [L46] char p31_old ; [L47] char p31_new ; [L48] _Bool ep31 ; [L49] port_t p32 ; [L50] char p32_old ; [L51] char p32_new ; [L52] _Bool ep32 ; [L53] char id1 ; [L54] unsigned char r1 ; [L55] char st1 ; [L56] char nl1 ; [L57] char m1 ; [L58] char max1 ; [L59] _Bool mode1 ; [L60] char id2 ; [L61] unsigned char r2 ; [L62] char st2 ; [L63] char nl2 ; [L64] char m2 ; [L65] char max2 ; [L66] _Bool mode2 ; [L67] char id3 ; [L68] unsigned char r3 ; [L69] char st3 ; [L70] char nl3 ; [L71] char m3 ; [L72] char max3 ; [L73] _Bool mode3 ; [L489] int c1 ; [L490] int i2 ; [L493] c1 = 0 [L494] ep12 = __VERIFIER_nondet_bool() [L495] ep13 = __VERIFIER_nondet_bool() [L496] ep21 = __VERIFIER_nondet_bool() [L497] ep23 = __VERIFIER_nondet_bool() [L498] ep31 = __VERIFIER_nondet_bool() [L499] ep32 = __VERIFIER_nondet_bool() [L500] id1 = __VERIFIER_nondet_char() [L501] r1 = __VERIFIER_nondet_uchar() [L502] st1 = __VERIFIER_nondet_char() [L503] nl1 = __VERIFIER_nondet_char() [L504] m1 = __VERIFIER_nondet_char() [L505] max1 = __VERIFIER_nondet_char() [L506] mode1 = __VERIFIER_nondet_bool() [L507] id2 = __VERIFIER_nondet_char() [L508] r2 = __VERIFIER_nondet_uchar() [L509] st2 = __VERIFIER_nondet_char() [L510] nl2 = __VERIFIER_nondet_char() [L511] m2 = __VERIFIER_nondet_char() [L512] max2 = __VERIFIER_nondet_char() [L513] mode2 = __VERIFIER_nondet_bool() [L514] id3 = __VERIFIER_nondet_char() [L515] r3 = __VERIFIER_nondet_uchar() [L516] st3 = __VERIFIER_nondet_char() [L517] nl3 = __VERIFIER_nondet_char() [L518] m3 = __VERIFIER_nondet_char() [L519] max3 = __VERIFIER_nondet_char() [L520] mode3 = __VERIFIER_nondet_bool() [L521] CALL, EXPR init() [L214] _Bool r121 ; [L215] _Bool r131 ; [L216] _Bool r211 ; [L217] _Bool r231 ; [L218] _Bool r311 ; [L219] _Bool r321 ; [L220] _Bool r122 ; [L221] int tmp ; [L222] _Bool r132 ; [L223] int tmp___0 ; [L224] _Bool r212 ; [L225] int tmp___1 ; [L226] _Bool r232 ; [L227] int tmp___2 ; [L228] _Bool r312 ; [L229] int tmp___3 ; [L230] _Bool r322 ; [L231] int tmp___4 ; [L232] int tmp___5 ; [L235] r121 = ep12 [L236] r131 = ep13 [L237] r211 = ep21 [L238] r231 = ep23 [L239] r311 = ep31 [L240] r321 = ep32 [L241] COND TRUE \read(r121) [L242] tmp = 1 [L253] r122 = (_Bool )tmp [L254] COND FALSE !(\read(r131)) [L257] COND TRUE \read(r121) [L258] COND TRUE \read(ep23) [L259] tmp___0 = 1 [L266] r132 = (_Bool )tmp___0 [L267] COND FALSE !(\read(r211)) [L270] COND TRUE \read(r231) [L271] COND TRUE \read(ep31) [L272] tmp___1 = 1 [L279] r212 = (_Bool )tmp___1 [L280] COND TRUE \read(r231) [L281] tmp___2 = 1 [L292] r232 = (_Bool )tmp___2 [L293] COND TRUE \read(r311) [L294] tmp___3 = 1 [L305] r312 = (_Bool )tmp___3 [L306] COND TRUE \read(r321) [L307] tmp___4 = 1 [L318] r322 = (_Bool )tmp___4 [L319] COND TRUE (int )id1 != (int )id2 [L320] COND TRUE (int )id1 != (int )id3 [L321] COND TRUE (int )id2 != (int )id3 [L322] COND TRUE (int )id1 >= 0 [L323] COND TRUE (int )id2 >= 0 [L324] COND TRUE (int )id3 >= 0 [L325] COND TRUE (int )r1 == 0 [L326] COND TRUE (int )r2 == 0 [L327] COND TRUE (int )r3 == 0 [L328] COND TRUE \read(r122) [L329] COND TRUE \read(r132) [L330] COND TRUE \read(r212) [L331] COND TRUE \read(r232) [L332] COND TRUE \read(r312) [L333] COND TRUE \read(r322) [L334] COND TRUE (int )max1 == (int )id1 [L335] COND TRUE (int )max2 == (int )id2 [L336] COND TRUE (int )max3 == (int )id3 [L337] COND TRUE (int )st1 == 0 [L338] COND TRUE (int )st2 == 0 [L339] COND TRUE (int )st3 == 0 [L340] COND TRUE (int )nl1 == 0 [L341] COND TRUE (int )nl2 == 0 [L342] COND TRUE (int )nl3 == 0 [L343] COND TRUE (int )mode1 == 0 [L344] COND TRUE (int )mode2 == 0 [L345] COND TRUE (int )mode3 == 0 [L346] tmp___5 = 1 [L428] return (tmp___5); [L521] RET, EXPR init() [L521] i2 = init() [L522] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L522] RET assume_abort_if_not(i2) [L523] p12_old = nomsg [L524] p12_new = nomsg [L525] p13_old = nomsg [L526] p13_new = nomsg [L527] p21_old = nomsg [L528] p21_new = nomsg [L529] p23_old = nomsg [L530] p23_new = nomsg [L531] p31_old = nomsg [L532] p31_new = nomsg [L533] p32_old = nomsg [L534] p32_new = nomsg [L535] i2 = 0 VAL [c1=0, ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, i2=0, id1=125, id2=126, id3=124, m1=126, m2=127, m3=0, max1=125, max2=126, max3=124, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L536] COND TRUE 1 [L538] CALL node1() [L79] COND FALSE !(\read(mode1)) [L107] COND TRUE (int )r1 < 2 [L108] COND TRUE \read(ep12) [L109] EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L109] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L111] COND FALSE !(\read(ep13)) [L115] mode1 = (_Bool)1 [L538] RET node1() [L539] CALL node2() [L125] COND FALSE !(\read(mode2)) [L153] COND TRUE (int )r2 < 2 [L154] COND FALSE !(\read(ep21)) [L157] COND TRUE \read(ep23) [L158] EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L158] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L161] mode2 = (_Bool)1 [L539] RET node2() [L540] CALL node3() [L171] COND FALSE !(\read(mode3)) [L199] COND TRUE (int )r3 < 2 [L200] COND TRUE \read(ep31) [L201] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L201] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L203] COND TRUE \read(ep32) [L204] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L204] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L207] mode3 = (_Bool)1 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=126, m2=127, m3=0, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L436] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=126, m2=127, m3=0, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L437] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=126, m2=127, m3=0, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L438] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=126, m2=127, m3=0, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L439] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=126, m2=127, m3=0, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L440] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=126, m2=127, m3=0, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L443] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=126, m2=127, m3=0, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L445] COND TRUE (int )r1 < 2 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=126, m2=127, m3=0, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L450] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=126, m2=127, m3=0, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L453] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=126, m2=127, m3=0, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L455] COND TRUE (int )r1 < 2 [L456] tmp = 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=126, m2=127, m3=0, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=126, m2=127, m3=0, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L554] RET assert(c1) [L536] COND TRUE 1 [L538] CALL node1() [L79] COND TRUE \read(mode1) [L80] COND FALSE !(r1 == 255) [L83] r1 = r1 + 1 [L84] COND FALSE !(\read(ep21)) [L91] COND TRUE \read(ep31) [L92] m1 = p31_old [L93] p31_old = nomsg [L94] COND FALSE !((int )m1 > (int )max1) [L98] COND FALSE !((int )r1 == 2) [L105] mode1 = (_Bool)0 [L538] RET node1() [L539] CALL node2() [L125] COND TRUE \read(mode2) [L126] COND FALSE !(r2 == 255) [L129] r2 = r2 + 1 [L130] COND TRUE \read(ep12) [L131] m2 = p12_old [L132] p12_old = nomsg [L133] COND FALSE !((int )m2 > (int )max2) [L137] COND TRUE \read(ep32) [L138] m2 = p32_old [L139] p32_old = nomsg [L140] COND FALSE !((int )m2 > (int )max2) [L144] COND FALSE !((int )r2 == 2) [L151] mode2 = (_Bool)0 [L539] RET node2() [L540] CALL node3() [L171] COND TRUE \read(mode3) [L172] COND FALSE !(r3 == 255) [L175] r3 = r3 + 1 [L176] COND FALSE !(\read(ep13)) [L183] COND TRUE \read(ep23) [L184] m3 = p23_old [L185] p23_old = nomsg [L186] COND TRUE (int )m3 > (int )max3 [L187] max3 = m3 [L190] COND FALSE !((int )r3 == 2) [L197] mode3 = (_Bool)0 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L436] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L437] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L438] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L439] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L443] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L445] COND TRUE (int )r1 < 2 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L450] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L453] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND TRUE (int )r1 < 2 [L456] tmp = 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L554] RET assert(c1) [L536] COND TRUE 1 [L538] CALL node1() [L79] COND FALSE !(\read(mode1)) [L107] COND TRUE (int )r1 < 2 [L108] COND TRUE \read(ep12) [L109] EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L109] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L111] COND FALSE !(\read(ep13)) [L115] mode1 = (_Bool)1 [L538] RET node1() [L539] CALL node2() [L125] COND FALSE !(\read(mode2)) [L153] COND TRUE (int )r2 < 2 [L154] COND FALSE !(\read(ep21)) [L157] COND TRUE \read(ep23) [L158] EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L158] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L161] mode2 = (_Bool)1 [L539] RET node2() [L540] CALL node3() [L171] COND FALSE !(\read(mode3)) [L199] COND TRUE (int )r3 < 2 [L200] COND TRUE \read(ep31) [L201] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L201] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L203] COND TRUE \read(ep32) [L204] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L204] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L207] mode3 = (_Bool)1 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L436] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L437] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L438] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L439] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L443] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L445] COND TRUE (int )r1 < 2 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L450] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L453] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND TRUE (int )r1 < 2 [L456] tmp = 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L554] RET assert(c1) [L536] COND TRUE 1 [L538] CALL node1() [L79] COND TRUE \read(mode1) [L80] COND FALSE !(r1 == 255) [L83] r1 = r1 + 1 [L84] COND FALSE !(\read(ep21)) [L91] COND TRUE \read(ep31) [L92] m1 = p31_old [L93] p31_old = nomsg [L94] COND TRUE (int )m1 > (int )max1 [L95] max1 = m1 [L98] COND TRUE (int )r1 == 2 [L99] COND FALSE !((int )max1 == (int )id1) [L102] st1 = (char)1 [L105] mode1 = (_Bool)0 [L538] RET node1() [L539] CALL node2() [L125] COND TRUE \read(mode2) [L126] COND FALSE !(r2 == 255) [L129] r2 = r2 + 1 [L130] COND TRUE \read(ep12) [L131] m2 = p12_old [L132] p12_old = nomsg [L133] COND FALSE !((int )m2 > (int )max2) [L137] COND TRUE \read(ep32) [L138] m2 = p32_old [L139] p32_old = nomsg [L140] COND FALSE !((int )m2 > (int )max2) [L144] COND TRUE (int )r2 == 2 [L145] COND TRUE (int )max2 == (int )id2 [L146] st2 = (char)1 [L151] mode2 = (_Bool)0 [L539] RET node2() [L540] CALL node3() [L171] COND TRUE \read(mode3) [L172] COND FALSE !(r3 == 255) [L175] r3 = r3 + 1 [L176] COND FALSE !(\read(ep13)) [L183] COND TRUE \read(ep23) [L184] m3 = p23_old [L185] p23_old = nomsg [L186] COND FALSE !((int )m3 > (int )max3) [L190] COND TRUE (int )r3 == 2 [L191] COND FALSE !((int )max3 == (int )id3) [L194] nl3 = (char)1 [L197] mode3 = (_Bool)0 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=126, m2=126, m3=126, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L436] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L482] tmp = 0 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=126, m2=126, m3=126, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0, tmp=0] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND TRUE ! arg VAL [\old(arg)=0, arg=0, ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=126, m2=126, m3=126, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L567] reach_error() VAL [\old(arg)=0, arg=0, ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=125, id2=126, id3=124, m1=126, m2=126, m3=126, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 121.6MB. Free memory is still 100.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 554.56ms. Allocated memory is still 121.6MB. Free memory was 83.7MB in the beginning and 90.8MB in the end (delta: -7.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.19ms. Allocated memory is still 121.6MB. Free memory was 90.8MB in the beginning and 88.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.83ms. Allocated memory is still 121.6MB. Free memory was 88.1MB in the beginning and 85.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1847.30ms. Allocated memory was 121.6MB in the beginning and 151.0MB in the end (delta: 29.4MB). Free memory was 85.6MB in the beginning and 104.5MB in the end (delta: -18.8MB). Peak memory consumption was 53.5MB. Max. memory is 16.1GB. * CodeCheck took 178422.52ms. Allocated memory was 151.0MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 104.5MB in the beginning and 625.9MB in the end (delta: -521.4MB). Peak memory consumption was 819.7MB. Max. memory is 16.1GB. * Witness Printer took 246.15ms. Allocated memory is still 1.5GB. Free memory was 625.9MB in the beginning and 605.9MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2021-11-22 23:12:15,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8faf2a9-6258-467b-8642-a52379a12733/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE