./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_33ba38ba-c53b-4acf-a99a-7ab9c29699ee/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_33ba38ba-c53b-4acf-a99a-7ab9c29699ee/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_33ba38ba-c53b-4acf-a99a-7ab9c29699ee/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_33ba38ba-c53b-4acf-a99a-7ab9c29699ee/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_33ba38ba-c53b-4acf-a99a-7ab9c29699ee/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_33ba38ba-c53b-4acf-a99a-7ab9c29699ee/bin/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c8186bb9e195ec2f40116dc473c413c4e1a34c0f .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-01 08:40:39,350 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-01 08:40:39,352 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-01 08:40:39,360 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-01 08:40:39,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-01 08:40:39,361 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-01 08:40:39,362 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-01 08:40:39,364 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-01 08:40:39,365 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-01 08:40:39,366 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-01 08:40:39,366 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-01 08:40:39,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-01 08:40:39,367 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-01 08:40:39,368 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-01 08:40:39,369 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-01 08:40:39,369 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-01 08:40:39,370 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-01 08:40:39,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-01 08:40:39,372 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-01 08:40:39,373 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-01 08:40:39,374 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-01 08:40:39,375 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-01 08:40:39,376 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-01 08:40:39,376 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-01 08:40:39,378 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-01 08:40:39,378 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-01 08:40:39,378 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-01 08:40:39,379 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-01 08:40:39,379 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-01 08:40:39,380 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-01 08:40:39,380 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-01 08:40:39,380 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-01 08:40:39,381 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-01 08:40:39,381 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-01 08:40:39,382 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-01 08:40:39,382 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-01 08:40:39,383 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-01 08:40:39,383 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-01 08:40:39,383 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-01 08:40:39,384 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-01 08:40:39,385 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-01 08:40:39,385 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_33ba38ba-c53b-4acf-a99a-7ab9c29699ee/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-12-01 08:40:39,398 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-01 08:40:39,398 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-01 08:40:39,399 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-01 08:40:39,399 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-12-01 08:40:39,399 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-01 08:40:39,399 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-01 08:40:39,400 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-01 08:40:39,400 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-01 08:40:39,400 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-01 08:40:39,400 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-01 08:40:39,400 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-01 08:40:39,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-01 08:40:39,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-01 08:40:39,401 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-01 08:40:39,401 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-01 08:40:39,401 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-01 08:40:39,402 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-01 08:40:39,402 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-01 08:40:39,402 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-12-01 08:40:39,402 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-12-01 08:40:39,402 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-01 08:40:39,403 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-01 08:40:39,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-12-01 08:40:39,403 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-01 08:40:39,403 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-01 08:40:39,403 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-01 08:40:39,403 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-12-01 08:40:39,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-01 08:40:39,404 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-01 08:40:39,404 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-vcloud-master/worker/run_dir_33ba38ba-c53b-4acf-a99a-7ab9c29699ee/bin/ukojak 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(__VERIFIER_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 -> c8186bb9e195ec2f40116dc473c413c4e1a34c0f [2019-12-01 08:40:39,505 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-01 08:40:39,516 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-01 08:40:39,519 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-01 08:40:39,520 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-01 08:40:39,520 INFO L275 PluginConnector]: CDTParser initialized [2019-12-01 08:40:39,521 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_33ba38ba-c53b-4acf-a99a-7ab9c29699ee/bin/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c [2019-12-01 08:40:39,563 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_33ba38ba-c53b-4acf-a99a-7ab9c29699ee/bin/ukojak/data/cc1212e44/7f1d6d15fae141778976e9b5c1fcf183/FLAGcf4254f8a [2019-12-01 08:40:40,043 INFO L306 CDTParser]: Found 1 translation units. [2019-12-01 08:40:40,044 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_33ba38ba-c53b-4acf-a99a-7ab9c29699ee/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c [2019-12-01 08:40:40,051 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_33ba38ba-c53b-4acf-a99a-7ab9c29699ee/bin/ukojak/data/cc1212e44/7f1d6d15fae141778976e9b5c1fcf183/FLAGcf4254f8a [2019-12-01 08:40:40,059 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_33ba38ba-c53b-4acf-a99a-7ab9c29699ee/bin/ukojak/data/cc1212e44/7f1d6d15fae141778976e9b5c1fcf183 [2019-12-01 08:40:40,061 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-01 08:40:40,062 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-01 08:40:40,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-01 08:40:40,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-01 08:40:40,065 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-01 08:40:40,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 08:40:40" (1/1) ... [2019-12-01 08:40:40,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@581b80cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:40:40, skipping insertion in model container [2019-12-01 08:40:40,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 08:40:40" (1/1) ... [2019-12-01 08:40:40,072 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-01 08:40:40,097 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-01 08:40:40,274 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-01 08:40:40,280 INFO L203 MainTranslator]: Completed pre-run [2019-12-01 08:40:40,319 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-01 08:40:40,330 INFO L208 MainTranslator]: Completed translation [2019-12-01 08:40:40,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:40:40 WrapperNode [2019-12-01 08:40:40,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-01 08:40:40,331 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-01 08:40:40,331 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-01 08:40:40,331 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-01 08:40:40,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:40:40" (1/1) ... [2019-12-01 08:40:40,345 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:40:40" (1/1) ... [2019-12-01 08:40:40,370 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-01 08:40:40,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-01 08:40:40,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-01 08:40:40,371 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-01 08:40:40,378 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:40:40" (1/1) ... [2019-12-01 08:40:40,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:40:40" (1/1) ... [2019-12-01 08:40:40,381 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:40:40" (1/1) ... [2019-12-01 08:40:40,381 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:40:40" (1/1) ... [2019-12-01 08:40:40,388 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:40:40" (1/1) ... [2019-12-01 08:40:40,394 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:40:40" (1/1) ... [2019-12-01 08:40:40,396 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:40:40" (1/1) ... [2019-12-01 08:40:40,399 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-01 08:40:40,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-01 08:40:40,399 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-01 08:40:40,399 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-01 08:40:40,400 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:40:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_33ba38ba-c53b-4acf-a99a-7ab9c29699ee/bin/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-12-01 08:40:40,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-01 08:40:40,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-01 08:40:42,090 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-01 08:40:42,090 INFO L287 CfgBuilder]: Removed 17 assume(true) statements. [2019-12-01 08:40:42,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 08:40:42 BoogieIcfgContainer [2019-12-01 08:40:42,091 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-01 08:40:42,092 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-12-01 08:40:42,092 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-12-01 08:40:42,098 INFO L275 PluginConnector]: CodeCheck initialized [2019-12-01 08:40:42,098 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 08:40:42" (1/1) ... [2019-12-01 08:40:42,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-01 08:40:42,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:40:42,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2019-12-01 08:40:42,127 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2019-12-01 08:40:42,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-01 08:40:42,129 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:40:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:40:42,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:40:42,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:40:42,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2019-12-01 08:40:42,486 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2019-12-01 08:40:42,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-01 08:40:42,486 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:40:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:40:42,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:40:42,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:40:42,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2019-12-01 08:40:42,790 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2019-12-01 08:40:42,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-01 08:40:42,792 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:40:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:40:42,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:40:43,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:40:43,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2019-12-01 08:40:43,191 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2019-12-01 08:40:43,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-01 08:40:43,191 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:40:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:40:43,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:40:43,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:40:43,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2019-12-01 08:40:43,697 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2019-12-01 08:40:43,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-01 08:40:43,698 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:40:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:40:43,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:40:44,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:40:44,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 40 states and 74 transitions. [2019-12-01 08:40:44,485 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 74 transitions. [2019-12-01 08:40:44,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-01 08:40:44,485 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:40:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:40:44,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:40:45,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:40:45,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 46 states and 86 transitions. [2019-12-01 08:40:45,372 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 86 transitions. [2019-12-01 08:40:45,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-01 08:40:45,373 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:40:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:40:45,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:40:45,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:40:45,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 47 states and 86 transitions. [2019-12-01 08:40:45,599 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2019-12-01 08:40:45,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-01 08:40:45,600 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:40:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:40:45,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:40:45,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:40:45,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 48 states and 87 transitions. [2019-12-01 08:40:45,633 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 87 transitions. [2019-12-01 08:40:45,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-01 08:40:45,634 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:40:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:40:45,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:40:47,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:40:47,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 58 states and 104 transitions. [2019-12-01 08:40:47,474 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 104 transitions. [2019-12-01 08:40:47,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-01 08:40:47,475 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:40:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:40:47,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:40:47,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:40:47,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 61 states and 109 transitions. [2019-12-01 08:40:47,783 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 109 transitions. [2019-12-01 08:40:47,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-01 08:40:47,783 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:40:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:40:48,851 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 33 [2019-12-01 08:40:49,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:40:53,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:40:53,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 77 states and 144 transitions. [2019-12-01 08:40:53,338 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 144 transitions. [2019-12-01 08:40:53,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-01 08:40:53,339 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:40:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:40:53,920 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:40:59,489 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-12-01 08:41:00,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:41:00,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 94 states and 178 transitions. [2019-12-01 08:41:00,572 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 178 transitions. [2019-12-01 08:41:00,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-01 08:41:00,573 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:41:00,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:41:00,987 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:41:08,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:41:08,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 112 states and 214 transitions. [2019-12-01 08:41:08,885 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 214 transitions. [2019-12-01 08:41:08,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-01 08:41:08,886 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:41:08,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:41:09,453 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:41:15,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:41:15,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 126 states and 238 transitions. [2019-12-01 08:41:15,358 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 238 transitions. [2019-12-01 08:41:15,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-01 08:41:15,360 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:41:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:41:16,815 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 37 [2019-12-01 08:41:17,259 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 37 [2019-12-01 08:41:17,818 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:41:22,806 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-12-01 08:41:24,097 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-12-01 08:41:26,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:41:26,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 145 states and 270 transitions. [2019-12-01 08:41:26,016 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 270 transitions. [2019-12-01 08:41:26,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-01 08:41:26,017 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:41:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:41:26,607 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:41:28,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:41:28,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 150 states and 280 transitions. [2019-12-01 08:41:28,553 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 280 transitions. [2019-12-01 08:41:28,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-01 08:41:28,554 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:41:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:41:30,844 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:41:37,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:41:37,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 158 states and 301 transitions. [2019-12-01 08:41:37,143 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 301 transitions. [2019-12-01 08:41:37,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-01 08:41:37,144 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:41:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:41:38,459 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:41:46,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:41:46,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 171 states and 331 transitions. [2019-12-01 08:41:46,453 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 331 transitions. [2019-12-01 08:41:46,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-01 08:41:46,454 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:41:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:41:46,598 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:41:48,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:41:48,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 176 states and 339 transitions. [2019-12-01 08:41:48,588 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 339 transitions. [2019-12-01 08:41:48,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-01 08:41:48,589 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:41:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:41:49,835 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:41:57,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:41:57,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 188 states and 361 transitions. [2019-12-01 08:41:57,467 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 361 transitions. [2019-12-01 08:41:57,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-01 08:41:57,467 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:41:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:41:57,571 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:42:01,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:42:01,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 190 states and 364 transitions. [2019-12-01 08:42:01,298 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 364 transitions. [2019-12-01 08:42:01,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-01 08:42:01,300 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:42:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:42:02,418 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:42:06,471 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2019-12-01 08:42:10,270 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2019-12-01 08:42:15,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:42:15,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 200 states and 382 transitions. [2019-12-01 08:42:15,279 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 382 transitions. [2019-12-01 08:42:15,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-01 08:42:15,280 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:42:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:42:15,372 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:42:18,382 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2019-12-01 08:42:20,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:42:20,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 204 states and 392 transitions. [2019-12-01 08:42:20,987 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 392 transitions. [2019-12-01 08:42:20,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-01 08:42:20,987 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:42:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:42:22,133 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:42:29,605 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-12-01 08:42:31,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:42:31,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 213 states and 409 transitions. [2019-12-01 08:42:31,324 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 409 transitions. [2019-12-01 08:42:31,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-01 08:42:31,325 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:42:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:42:31,398 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:42:35,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:42:35,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 212 states and 415 transitions. [2019-12-01 08:42:35,684 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 415 transitions. [2019-12-01 08:42:35,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-01 08:42:35,685 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:42:35,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:42:35,745 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:42:38,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:42:38,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 215 states and 424 transitions. [2019-12-01 08:42:38,964 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 424 transitions. [2019-12-01 08:42:38,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-01 08:42:38,965 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:42:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:42:40,439 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:42:45,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:42:45,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 218 states and 432 transitions. [2019-12-01 08:42:45,336 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 432 transitions. [2019-12-01 08:42:45,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-01 08:42:45,337 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:42:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:42:45,568 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:42:50,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:42:50,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 223 states and 447 transitions. [2019-12-01 08:42:50,932 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 447 transitions. [2019-12-01 08:42:50,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-01 08:42:50,933 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:42:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:42:51,159 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:42:53,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:42:53,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 226 states and 458 transitions. [2019-12-01 08:42:53,831 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 458 transitions. [2019-12-01 08:42:53,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-01 08:42:53,831 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:42:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:42:54,054 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:42:56,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:42:56,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 230 states and 470 transitions. [2019-12-01 08:42:56,562 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 470 transitions. [2019-12-01 08:42:56,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-01 08:42:56,563 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:42:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:42:57,537 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:43:04,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:43:04,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 234 states and 482 transitions. [2019-12-01 08:43:04,200 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 482 transitions. [2019-12-01 08:43:04,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-01 08:43:04,201 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:43:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:43:04,261 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:43:07,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:43:07,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 237 states and 492 transitions. [2019-12-01 08:43:07,395 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 492 transitions. [2019-12-01 08:43:07,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-01 08:43:07,397 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:43:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:43:07,469 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:43:10,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:43:10,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 241 states and 502 transitions. [2019-12-01 08:43:10,484 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 502 transitions. [2019-12-01 08:43:10,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-01 08:43:10,485 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:43:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:43:10,544 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:43:11,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:43:11,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 242 states and 503 transitions. [2019-12-01 08:43:11,211 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 503 transitions. [2019-12-01 08:43:11,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-01 08:43:11,211 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:43:11,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:43:11,270 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:43:11,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:43:11,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 243 states and 504 transitions. [2019-12-01 08:43:11,957 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 504 transitions. [2019-12-01 08:43:11,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-01 08:43:11,958 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:43:11,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:43:12,018 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:43:15,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:43:15,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 246 states and 512 transitions. [2019-12-01 08:43:15,360 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 512 transitions. [2019-12-01 08:43:15,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-01 08:43:15,361 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:43:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:43:15,744 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:43:18,360 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2019-12-01 08:43:23,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:43:23,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 252 states and 531 transitions. [2019-12-01 08:43:23,622 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 531 transitions. [2019-12-01 08:43:23,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-01 08:43:23,623 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:43:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:43:23,774 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:43:26,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:43:26,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 256 states and 541 transitions. [2019-12-01 08:43:26,214 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 541 transitions. [2019-12-01 08:43:26,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-01 08:43:26,214 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:43:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:43:26,346 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:43:29,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:43:29,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 260 states and 552 transitions. [2019-12-01 08:43:29,221 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 552 transitions. [2019-12-01 08:43:29,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-01 08:43:29,221 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:43:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:43:29,357 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:43:29,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:43:29,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 261 states and 554 transitions. [2019-12-01 08:43:29,861 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 554 transitions. [2019-12-01 08:43:29,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-01 08:43:29,861 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:43:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 08:43:30,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 08:43:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 08:43:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 08:43:35,756 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 41 iterations. [2019-12-01 08:43:35,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 08:43:35 ImpRootNode [2019-12-01 08:43:35,860 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-12-01 08:43:35,861 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-01 08:43:35,861 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-01 08:43:35,861 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-01 08:43:35,861 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 08:40:42" (3/4) ... [2019-12-01 08:43:35,863 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-01 08:43:35,974 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_33ba38ba-c53b-4acf-a99a-7ab9c29699ee/bin/ukojak/witness.graphml [2019-12-01 08:43:35,974 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-01 08:43:35,975 INFO L168 Benchmark]: Toolchain (without parser) took 175912.90 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 275.3 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -196.6 MB). Peak memory consumption was 487.4 MB. Max. memory is 11.5 GB. [2019-12-01 08:43:35,975 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-01 08:43:35,975 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.8 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -138.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-12-01 08:43:35,976 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-01 08:43:35,976 INFO L168 Benchmark]: Boogie Preprocessor took 28.46 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-01 08:43:35,976 INFO L168 Benchmark]: RCFGBuilder took 1692.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 944.6 MB in the end (delta: 132.3 MB). Peak memory consumption was 257.3 MB. Max. memory is 11.5 GB. [2019-12-01 08:43:35,976 INFO L168 Benchmark]: CodeCheck took 173768.54 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 157.3 MB). Free memory was 944.6 MB in the beginning and 726.3 MB in the end (delta: 218.3 MB). Peak memory consumption was 375.6 MB. Max. memory is 11.5 GB. [2019-12-01 08:43:35,976 INFO L168 Benchmark]: Witness Printer took 113.59 ms. Allocated memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 25.2 MB). Free memory was 726.3 MB in the beginning and 1.1 GB in the end (delta: -413.8 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2019-12-01 08:43:35,978 INFO L335 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. Result: UNSAFE, OverallTime: 173.6s, OverallIterations: 41, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: -631275908 SDtfs, 282241870 SDslu, -518271890 SDs, 0 SdLazy, 583313694 SolverSat, 1294976410 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 75.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12178 GetRequests, 10624 SyntacticMatches, 612 SemanticMatches, 942 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546939 ImplicationChecksByTransitivity, 159.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 6.1s SatisfiabilityAnalysisTime, 16.8s InterpolantComputationTime, 1207 NumberOfCodeBlocks, 1207 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1119 ConstructedInterpolants, 0 QuantifiedInterpolants, 368106 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 10 PerfectInterpolantSequences, 142/752 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: 643]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L69] msg_t nomsg = (msg_t )-1; [L70] port_t p12 ; [L71] char p12_old ; [L72] char p12_new ; [L73] _Bool ep12 ; [L74] port_t p13 ; [L75] char p13_old ; [L76] char p13_new ; [L77] _Bool ep13 ; [L78] port_t p21 ; [L79] char p21_old ; [L80] char p21_new ; [L81] _Bool ep21 ; [L82] port_t p23 ; [L83] char p23_old ; [L84] char p23_new ; [L85] _Bool ep23 ; [L86] port_t p31 ; [L87] char p31_old ; [L88] char p31_new ; [L89] _Bool ep31 ; [L90] port_t p32 ; [L91] char p32_old ; [L92] char p32_new ; [L93] _Bool ep32 ; [L94] char id1 ; [L95] char r1 ; [L96] char st1 ; [L97] char nl1 ; [L98] char m1 ; [L99] char max1 ; [L100] _Bool mode1 ; [L101] _Bool newmax1 ; [L102] char id2 ; [L103] char r2 ; [L104] char st2 ; [L105] char nl2 ; [L106] char m2 ; [L107] char max2 ; [L108] _Bool mode2 ; [L109] _Bool newmax2 ; [L110] char id3 ; [L111] char r3 ; [L112] char st3 ; [L113] char nl3 ; [L114] char m3 ; [L115] char max3 ; [L116] _Bool mode3 ; [L117] _Bool newmax3 ; [L271] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L561] int c1 ; [L562] int i2 ; [L565] c1 = 0 [L566] ep12 = __VERIFIER_nondet_bool() [L567] ep13 = __VERIFIER_nondet_bool() [L568] ep21 = __VERIFIER_nondet_bool() [L569] ep23 = __VERIFIER_nondet_bool() [L570] ep31 = __VERIFIER_nondet_bool() [L571] ep32 = __VERIFIER_nondet_bool() [L572] id1 = __VERIFIER_nondet_char() [L573] r1 = __VERIFIER_nondet_char() [L574] st1 = __VERIFIER_nondet_char() [L575] nl1 = __VERIFIER_nondet_char() [L576] m1 = __VERIFIER_nondet_char() [L577] max1 = __VERIFIER_nondet_char() [L578] mode1 = __VERIFIER_nondet_bool() [L579] newmax1 = __VERIFIER_nondet_bool() [L580] id2 = __VERIFIER_nondet_char() [L581] r2 = __VERIFIER_nondet_char() [L582] st2 = __VERIFIER_nondet_char() [L583] nl2 = __VERIFIER_nondet_char() [L584] m2 = __VERIFIER_nondet_char() [L585] max2 = __VERIFIER_nondet_char() [L586] mode2 = __VERIFIER_nondet_bool() [L587] newmax2 = __VERIFIER_nondet_bool() [L588] id3 = __VERIFIER_nondet_char() [L589] r3 = __VERIFIER_nondet_char() [L590] st3 = __VERIFIER_nondet_char() [L591] nl3 = __VERIFIER_nondet_char() [L592] m3 = __VERIFIER_nondet_char() [L593] max3 = __VERIFIER_nondet_char() [L594] mode3 = __VERIFIER_nondet_bool() [L595] newmax3 = __VERIFIER_nondet_bool() [L274] _Bool r121 ; [L275] _Bool r131 ; [L276] _Bool r211 ; [L277] _Bool r231 ; [L278] _Bool r311 ; [L279] _Bool r321 ; [L280] _Bool r122 ; [L281] int tmp ; [L282] _Bool r132 ; [L283] int tmp___0 ; [L284] _Bool r212 ; [L285] int tmp___1 ; [L286] _Bool r232 ; [L287] int tmp___2 ; [L288] _Bool r312 ; [L289] int tmp___3 ; [L290] _Bool r322 ; [L291] int tmp___4 ; [L292] int tmp___5 ; [L295] r121 = ep12 [L296] r131 = ep13 [L297] r211 = ep21 [L298] r231 = ep23 [L299] r311 = ep31 [L300] r321 = ep32 [L301] COND TRUE \read(r121) [L302] tmp = 1 [L313] r122 = (_Bool )tmp [L314] COND FALSE !(\read(r131)) [L317] COND TRUE \read(r121) [L318] COND TRUE \read(ep23) [L319] tmp___0 = 1 [L326] r132 = (_Bool )tmp___0 [L327] COND FALSE !(\read(r211)) [L330] COND TRUE \read(r231) [L331] COND TRUE \read(ep31) [L332] tmp___1 = 1 [L339] r212 = (_Bool )tmp___1 [L340] COND TRUE \read(r231) [L341] tmp___2 = 1 [L352] r232 = (_Bool )tmp___2 [L353] COND TRUE \read(r311) [L354] tmp___3 = 1 [L365] r312 = (_Bool )tmp___3 [L366] COND TRUE \read(r321) [L367] tmp___4 = 1 [L378] r322 = (_Bool )tmp___4 [L379] COND TRUE (int )id1 != (int )id2 [L380] COND TRUE (int )id1 != (int )id3 [L381] COND TRUE (int )id2 != (int )id3 [L382] COND TRUE (int )id1 >= 0 [L383] COND TRUE (int )id2 >= 0 [L384] COND TRUE (int )id3 >= 0 [L385] COND TRUE (int )r1 == 0 [L386] COND TRUE (int )r2 == 0 [L387] COND TRUE (int )r3 == 0 [L388] COND TRUE \read(r122) [L389] COND TRUE \read(r132) [L390] COND TRUE \read(r212) [L391] COND TRUE \read(r232) [L392] COND TRUE \read(r312) [L393] COND TRUE \read(r322) [L394] COND TRUE (int )max1 == (int )id1 [L395] COND TRUE (int )max2 == (int )id2 [L396] COND TRUE (int )max3 == (int )id3 [L397] COND TRUE (int )st1 == 0 [L398] COND TRUE (int )st2 == 0 [L399] COND TRUE (int )st3 == 0 [L400] COND TRUE (int )nl1 == 0 [L401] COND TRUE (int )nl2 == 0 [L402] COND TRUE (int )nl3 == 0 [L403] COND TRUE (int )mode1 == 0 [L404] COND TRUE (int )mode2 == 0 [L405] COND TRUE (int )mode3 == 0 [L406] COND TRUE \read(newmax1) [L407] COND TRUE \read(newmax2) [L408] COND TRUE \read(newmax3) [L409] tmp___5 = 1 [L500] return (tmp___5); [L596] i2 = init() [L598] p12_old = nomsg [L599] p12_new = nomsg [L600] p13_old = nomsg [L601] p13_new = nomsg [L602] p21_old = nomsg [L603] p21_new = nomsg [L604] p23_old = nomsg [L605] p23_new = nomsg [L606] p31_old = nomsg [L607] p31_new = nomsg [L608] p32_old = nomsg [L609] p32_new = nomsg [L610] i2 = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=2, m2=1, m3=0, max1=1, max2=0, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] [L611] COND TRUE i2 < 6 [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND FALSE !(\read(mode1)) [L152] COND TRUE (int )r1 < 2 [L153] COND TRUE \read(ep12) [L154] COND TRUE \read(newmax1) [L155] EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L155] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L158] COND FALSE !(\read(ep13)) [L164] mode1 = (_Bool)1 [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND FALSE !(\read(mode2)) [L203] COND TRUE (int )r2 < 2 [L204] COND FALSE !(\read(ep21)) [L209] COND TRUE \read(ep23) [L210] COND TRUE \read(newmax2) [L211] EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L211] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L215] mode2 = (_Bool)1 [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND FALSE !(\read(mode3)) [L254] COND TRUE (int )r3 < 2 [L255] COND TRUE \read(ep31) [L256] COND TRUE \read(newmax3) [L257] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L257] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L260] COND TRUE \read(ep32) [L261] COND TRUE \read(newmax3) [L262] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L262] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L266] mode3 = (_Bool)1 [L616] p12_old = p12_new [L617] p12_new = nomsg [L618] p13_old = p13_new [L619] p13_new = nomsg [L620] p21_old = p21_new [L621] p21_new = nomsg [L622] p23_old = p23_new [L623] p23_new = nomsg [L624] p31_old = p31_new [L625] p31_new = nomsg [L626] p32_old = p32_new [L627] p32_new = nomsg [L505] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=2, m2=1, m3=0, max1=1, max2=0, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, 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=0, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L508] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=2, m2=1, m3=0, max1=1, max2=0, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, 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=0, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L509] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=2, m2=1, m3=0, max1=1, max2=0, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, 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=0, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L510] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=2, m2=1, m3=0, max1=1, max2=0, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, 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=0, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L511] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=2, m2=1, m3=0, max1=1, max2=0, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, 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=0, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L512] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=2, m2=1, m3=0, max1=1, max2=0, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, 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=0, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L515] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=2, m2=1, m3=0, max1=1, max2=0, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, 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=0, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L517] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=2, m2=1, m3=0, max1=1, max2=0, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, 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=0, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=2, m2=1, m3=0, max1=1, max2=0, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, 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=0, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L525] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=2, m2=1, m3=0, max1=1, max2=0, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, 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=0, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L527] COND TRUE (int )r1 < 2 [L528] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=2, m2=1, m3=0, max1=1, max2=0, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, 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=0, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L556] return (tmp); [L628] c1 = check() [L641] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=2, m2=1, m3=0, max1=1, max2=0, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, 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=0, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L630] i2 ++ VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=2, m2=1, m3=0, max1=1, max2=0, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, 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=0, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L611] COND TRUE i2 < 6 [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND TRUE \read(mode1) [L125] r1 = (char )((int )r1 + 1) [L126] COND FALSE !(\read(ep21)) [L134] COND TRUE \read(ep31) [L135] m1 = p31_old [L136] p31_old = nomsg [L137] COND TRUE (int )m1 > (int )max1 [L138] max1 = m1 [L139] newmax = (_Bool)1 [L142] newmax1 = newmax [L143] COND FALSE !((int )r1 == 2) [L150] mode1 = (_Bool)0 [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND TRUE \read(mode2) [L176] r2 = (char )((int )r2 + 1) [L177] COND TRUE \read(ep12) [L178] m2 = p12_old [L179] p12_old = nomsg [L180] COND TRUE (int )m2 > (int )max2 [L181] max2 = m2 [L182] newmax = (_Bool)1 [L185] COND TRUE \read(ep32) [L186] m2 = p32_old [L187] p32_old = nomsg [L188] COND TRUE (int )m2 > (int )max2 [L189] max2 = m2 [L190] newmax = (_Bool)1 [L193] newmax2 = newmax [L194] COND FALSE !((int )r2 == 2) [L201] mode2 = (_Bool)0 [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND TRUE \read(mode3) [L227] r3 = (char )((int )r3 + 1) [L228] COND FALSE !(\read(ep13)) [L236] COND TRUE \read(ep23) [L237] m3 = p23_old [L238] p23_old = nomsg [L239] COND FALSE !((int )m3 > (int )max3) [L244] newmax3 = newmax [L245] COND FALSE !((int )r3 == 2) [L252] mode3 = (_Bool)0 [L616] p12_old = p12_new [L617] p12_new = nomsg [L618] p13_old = p13_new [L619] p13_new = nomsg [L620] p21_old = p21_new [L621] p21_new = nomsg [L622] p23_old = p23_new [L623] p23_new = nomsg [L624] p31_old = p31_new [L625] p31_new = nomsg [L626] p32_old = p32_new [L627] p32_new = nomsg [L505] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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] [L508] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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] [L509] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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] [L510] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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] [L511] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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] [L512] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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] [L515] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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] [L517] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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] [L525] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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] [L527] COND TRUE (int )r1 < 2 [L528] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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] [L556] return (tmp); [L628] c1 = check() [L641] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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] [L630] i2 ++ VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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] [L611] COND TRUE i2 < 6 [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND FALSE !(\read(mode1)) [L152] COND TRUE (int )r1 < 2 [L153] COND TRUE \read(ep12) [L154] COND TRUE \read(newmax1) [L155] EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L155] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L158] COND FALSE !(\read(ep13)) [L164] mode1 = (_Bool)1 [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND FALSE !(\read(mode2)) [L203] COND TRUE (int )r2 < 2 [L204] COND FALSE !(\read(ep21)) [L209] COND TRUE \read(ep23) [L210] COND TRUE \read(newmax2) [L211] EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L211] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L215] mode2 = (_Bool)1 [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND FALSE !(\read(mode3)) [L254] COND TRUE (int )r3 < 2 [L255] COND TRUE \read(ep31) [L256] COND FALSE !(\read(newmax3)) [L260] COND TRUE \read(ep32) [L261] COND FALSE !(\read(newmax3)) [L266] mode3 = (_Bool)1 [L616] p12_old = p12_new [L617] p12_new = nomsg [L618] p13_old = p13_new [L619] p13_new = nomsg [L620] p21_old = p21_new [L621] p21_new = nomsg [L622] p23_old = p23_new [L623] p23_new = nomsg [L624] p31_old = p31_new [L625] p31_new = nomsg [L626] p32_old = p32_new [L627] p32_new = nomsg [L505] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L508] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L509] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L510] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L511] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L512] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L515] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L517] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L525] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L527] COND TRUE (int )r1 < 2 [L528] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L556] return (tmp); [L628] c1 = check() [L641] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L630] i2 ++ VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L611] COND TRUE i2 < 6 [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND TRUE \read(mode1) [L125] r1 = (char )((int )r1 + 1) [L126] COND FALSE !(\read(ep21)) [L134] COND TRUE \read(ep31) [L135] m1 = p31_old [L136] p31_old = nomsg [L137] COND FALSE !((int )m1 > (int )max1) [L142] newmax1 = newmax [L143] COND TRUE (int )r1 == 2 [L144] COND FALSE !((int )max1 == (int )id1) [L147] st1 = (char)1 [L150] mode1 = (_Bool)0 [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND TRUE \read(mode2) [L176] r2 = (char )((int )r2 + 1) [L177] COND TRUE \read(ep12) [L178] m2 = p12_old [L179] p12_old = nomsg [L180] COND FALSE !((int )m2 > (int )max2) [L185] COND TRUE \read(ep32) [L186] m2 = p32_old [L187] p32_old = nomsg [L188] COND FALSE !((int )m2 > (int )max2) [L193] newmax2 = newmax [L194] COND TRUE (int )r2 == 2 [L195] COND FALSE !((int )max2 == (int )id2) [L198] nl2 = (char)1 [L201] mode2 = (_Bool)0 [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND TRUE \read(mode3) [L227] r3 = (char )((int )r3 + 1) [L228] COND FALSE !(\read(ep13)) [L236] COND TRUE \read(ep23) [L237] m3 = p23_old [L238] p23_old = nomsg [L239] COND FALSE !((int )m3 > (int )max3) [L244] newmax3 = newmax [L245] COND TRUE (int )r3 == 2 [L246] COND TRUE (int )max3 == (int )id3 [L247] st3 = (char)1 [L252] mode3 = (_Bool)0 [L616] p12_old = p12_new [L617] p12_new = nomsg [L618] p13_old = p13_new [L619] p13_new = nomsg [L620] p21_old = p21_new [L621] p21_new = nomsg [L622] p23_old = p23_new [L623] p23_new = nomsg [L624] p31_old = p31_new [L625] p31_new = nomsg [L626] p32_old = p32_new [L627] p32_new = nomsg [L505] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=-1, m2=-1, m3=3, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=1, 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=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L508] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L554] tmp = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=-1, m2=-1, m3=3, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=1, 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=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L556] return (tmp); [L628] c1 = check() [L641] COND TRUE ! arg VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=-1, m2=-1, m3=3, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=1, 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=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L643] __VERIFIER_error() VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=1, id2=0, id3=3, m1=-1, m2=-1, m3=3, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=1, 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=2, r2=2, r3=2, st1=1, st2=0, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 268.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.8 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -138.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.46 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1692.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 944.6 MB in the end (delta: 132.3 MB). Peak memory consumption was 257.3 MB. Max. memory is 11.5 GB. * CodeCheck took 173768.54 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 157.3 MB). Free memory was 944.6 MB in the beginning and 726.3 MB in the end (delta: 218.3 MB). Peak memory consumption was 375.6 MB. Max. memory is 11.5 GB. * Witness Printer took 113.59 ms. Allocated memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 25.2 MB). Free memory was 726.3 MB in the beginning and 1.1 GB in the end (delta: -413.8 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...