./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_be1ce447-f51f-442c-816e-b54111b25de9/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_be1ce447-f51f-442c-816e-b54111b25de9/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_be1ce447-f51f-442c-816e-b54111b25de9/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_be1ce447-f51f-442c-816e-b54111b25de9/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_be1ce447-f51f-442c-816e-b54111b25de9/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_be1ce447-f51f-442c-816e-b54111b25de9/bin-2019/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 e933d4cdc4956da0da3b7a9eafbe7f31dfa7607e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.23-1dbac8b [2018-11-10 04:54:43,991 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:54:43,992 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:54:43,999 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:54:44,000 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:54:44,000 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:54:44,001 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:54:44,002 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:54:44,003 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:54:44,004 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:54:44,004 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:54:44,005 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:54:44,005 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:54:44,006 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:54:44,007 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:54:44,007 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:54:44,008 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:54:44,009 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:54:44,010 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:54:44,010 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:54:44,011 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:54:44,011 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:54:44,013 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:54:44,013 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:54:44,013 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:54:44,013 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:54:44,014 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:54:44,015 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:54:44,015 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:54:44,016 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:54:44,016 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:54:44,017 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:54:44,017 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:54:44,017 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:54:44,018 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:54:44,018 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:54:44,019 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_be1ce447-f51f-442c-816e-b54111b25de9/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 04:54:44,026 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:54:44,026 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:54:44,027 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 04:54:44,027 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 04:54:44,027 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 04:54:44,028 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 04:54:44,028 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:54:44,028 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 04:54:44,028 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:54:44,028 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 04:54:44,028 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:54:44,028 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 04:54:44,029 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 04:54:44,029 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 04:54:44,029 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 04:54:44,029 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:54:44,029 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 04:54:44,029 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 04:54:44,029 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 04:54:44,030 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:54:44,030 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 04:54:44,030 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 04:54:44,030 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:54:44,030 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 04:54:44,030 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 04:54:44,030 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 04:54:44,031 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 04:54:44,031 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 04:54:44,031 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_be1ce447-f51f-442c-816e-b54111b25de9/bin-2019/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 -> e933d4cdc4956da0da3b7a9eafbe7f31dfa7607e [2018-11-10 04:54:44,056 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:54:44,066 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:54:44,068 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:54:44,069 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:54:44,069 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:54:44,070 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_be1ce447-f51f-442c-816e-b54111b25de9/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2018-11-10 04:54:44,113 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_be1ce447-f51f-442c-816e-b54111b25de9/bin-2019/ukojak/data/da0e7338e/ba4b665df4bc452eb01bbc7c790d5494/FLAG0a270418c [2018-11-10 04:54:44,564 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:54:44,565 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_be1ce447-f51f-442c-816e-b54111b25de9/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2018-11-10 04:54:44,571 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_be1ce447-f51f-442c-816e-b54111b25de9/bin-2019/ukojak/data/da0e7338e/ba4b665df4bc452eb01bbc7c790d5494/FLAG0a270418c [2018-11-10 04:54:44,580 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_be1ce447-f51f-442c-816e-b54111b25de9/bin-2019/ukojak/data/da0e7338e/ba4b665df4bc452eb01bbc7c790d5494 [2018-11-10 04:54:44,582 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:54:44,583 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:54:44,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:54:44,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:54:44,587 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:54:44,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:54:44" (1/1) ... [2018-11-10 04:54:44,590 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f2f9cc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:44, skipping insertion in model container [2018-11-10 04:54:44,590 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:54:44" (1/1) ... [2018-11-10 04:54:44,599 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:54:44,640 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:54:44,842 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:54:44,850 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:54:44,926 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:54:44,936 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:54:44,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:44 WrapperNode [2018-11-10 04:54:44,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:54:44,937 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:54:44,937 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:54:44,937 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:54:44,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:44" (1/1) ... [2018-11-10 04:54:44,996 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:44" (1/1) ... [2018-11-10 04:54:45,030 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:54:45,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:54:45,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:54:45,031 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:54:45,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:44" (1/1) ... [2018-11-10 04:54:45,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:44" (1/1) ... [2018-11-10 04:54:45,042 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:44" (1/1) ... [2018-11-10 04:54:45,042 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:44" (1/1) ... [2018-11-10 04:54:45,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:44" (1/1) ... [2018-11-10 04:54:45,058 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:44" (1/1) ... [2018-11-10 04:54:45,061 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:44" (1/1) ... [2018-11-10 04:54:45,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:54:45,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:54:45,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:54:45,065 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:54:45,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_be1ce447-f51f-442c-816e-b54111b25de9/bin-2019/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 [2018-11-10 04:54:45,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:54:45,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:54:46,391 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:54:46,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:54:46 BoogieIcfgContainer [2018-11-10 04:54:46,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:54:46,393 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 04:54:46,393 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 04:54:46,402 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 04:54:46,402 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:54:46" (1/1) ... [2018-11-10 04:54:46,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:54:46,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:54:46,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 173 states and 303 transitions. [2018-11-10 04:54:46,446 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 303 transitions. [2018-11-10 04:54:46,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-10 04:54:46,450 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:54:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:54:46,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:54:46,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:54:46,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 183 states and 326 transitions. [2018-11-10 04:54:46,949 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 326 transitions. [2018-11-10 04:54:46,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 04:54:46,951 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:54:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:54:47,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:54:47,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:54:47,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 183 states and 324 transitions. [2018-11-10 04:54:47,115 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 324 transitions. [2018-11-10 04:54:47,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 04:54:47,117 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:54:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:54:47,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:54:47,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:54:47,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 189 states and 336 transitions. [2018-11-10 04:54:47,358 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 336 transitions. [2018-11-10 04:54:47,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 04:54:47,362 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:54:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:54:47,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:54:47,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:54:47,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 191 states and 340 transitions. [2018-11-10 04:54:47,499 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 340 transitions. [2018-11-10 04:54:47,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 04:54:47,500 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:54:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:54:47,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:54:47,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:54:47,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 202 states and 365 transitions. [2018-11-10 04:54:47,952 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 365 transitions. [2018-11-10 04:54:47,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 04:54:47,953 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:54:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:54:47,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:54:48,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:54:48,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 204 states and 371 transitions. [2018-11-10 04:54:48,111 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 371 transitions. [2018-11-10 04:54:48,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 04:54:48,114 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:54:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:54:48,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:54:48,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:54:48,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 205 states and 372 transitions. [2018-11-10 04:54:48,280 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 372 transitions. [2018-11-10 04:54:48,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 04:54:48,281 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:54:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:54:48,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:54:49,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:54:49,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 205 states and 371 transitions. [2018-11-10 04:54:49,512 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 371 transitions. [2018-11-10 04:54:49,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 04:54:49,513 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:54:49,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:54:49,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:54:52,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:54:52,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 212 states and 387 transitions. [2018-11-10 04:54:52,096 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 387 transitions. [2018-11-10 04:54:52,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 04:54:52,097 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:54:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:54:52,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:54:57,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:54:57,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 226 states and 416 transitions. [2018-11-10 04:54:57,910 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 416 transitions. [2018-11-10 04:54:57,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 04:54:57,911 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:54:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:54:57,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:54:58,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:54:58,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 230 states and 422 transitions. [2018-11-10 04:54:58,235 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 422 transitions. [2018-11-10 04:54:58,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 04:54:58,236 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:54:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:54:58,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:54:59,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:54:59,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 233 states and 428 transitions. [2018-11-10 04:54:59,302 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 428 transitions. [2018-11-10 04:54:59,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 04:54:59,302 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:54:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:54:59,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:55:05,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:55:05,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 239 states and 441 transitions. [2018-11-10 04:55:05,320 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 441 transitions. [2018-11-10 04:55:05,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 04:55:05,320 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:55:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:55:05,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:55:05,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:55:05,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 243 states and 447 transitions. [2018-11-10 04:55:05,412 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 447 transitions. [2018-11-10 04:55:05,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 04:55:05,412 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:55:05,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:55:05,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:55:05,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:55:05,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 246 states and 456 transitions. [2018-11-10 04:55:05,779 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 456 transitions. [2018-11-10 04:55:05,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 04:55:05,780 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:55:05,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:55:05,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:55:06,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:55:06,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 247 states and 458 transitions. [2018-11-10 04:55:06,981 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 458 transitions. [2018-11-10 04:55:06,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 04:55:06,982 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:55:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:55:06,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:55:07,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:55:07,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 248 states and 459 transitions. [2018-11-10 04:55:07,892 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 459 transitions. [2018-11-10 04:55:07,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 04:55:07,892 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:55:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:55:07,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:55:08,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:55:08,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 249 states and 460 transitions. [2018-11-10 04:55:08,204 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 460 transitions. [2018-11-10 04:55:08,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 04:55:08,205 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:55:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:55:08,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:55:10,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:55:10,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 236 states and 421 transitions. [2018-11-10 04:55:10,005 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 421 transitions. [2018-11-10 04:55:10,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 04:55:10,006 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:55:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:55:10,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:55:13,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:55:13,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 244 states and 437 transitions. [2018-11-10 04:55:13,283 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 437 transitions. [2018-11-10 04:55:13,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 04:55:13,283 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:55:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:55:13,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:55:14,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:55:14,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 246 states and 441 transitions. [2018-11-10 04:55:14,332 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 441 transitions. [2018-11-10 04:55:14,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 04:55:14,332 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:55:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:55:14,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:55:15,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:55:15,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 250 states and 447 transitions. [2018-11-10 04:55:15,732 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 447 transitions. [2018-11-10 04:55:15,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 04:55:15,732 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:55:15,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:55:15,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:55:16,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:55:16,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 251 states and 449 transitions. [2018-11-10 04:55:16,276 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 449 transitions. [2018-11-10 04:55:16,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 04:55:16,276 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:55:16,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:55:16,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:55:17,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:55:17,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 256 states and 460 transitions. [2018-11-10 04:55:17,220 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 460 transitions. [2018-11-10 04:55:17,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 04:55:17,221 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:55:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:55:17,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:55:21,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:55:21,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 265 states and 479 transitions. [2018-11-10 04:55:21,163 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 479 transitions. [2018-11-10 04:55:21,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 04:55:21,163 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:55:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:55:21,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:55:22,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:55:22,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 269 states and 484 transitions. [2018-11-10 04:55:22,573 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 484 transitions. [2018-11-10 04:55:22,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 04:55:22,573 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:55:22,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:55:22,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:55:22,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:55:22,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 271 states and 489 transitions. [2018-11-10 04:55:22,612 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 489 transitions. [2018-11-10 04:55:22,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 04:55:22,612 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:55:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:55:22,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:55:22,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:55:22,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 273 states and 493 transitions. [2018-11-10 04:55:22,667 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 493 transitions. [2018-11-10 04:55:22,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 04:55:22,667 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:55:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:55:22,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:55:26,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:55:26,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 277 states and 503 transitions. [2018-11-10 04:55:26,022 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 503 transitions. [2018-11-10 04:55:26,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 04:55:26,022 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:55:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:55:26,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:55:29,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:55:29,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 279 states and 506 transitions. [2018-11-10 04:55:29,078 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 506 transitions. [2018-11-10 04:55:29,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 04:55:29,079 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:55:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:55:29,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:55:31,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:55:31,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 278 states and 504 transitions. [2018-11-10 04:55:31,042 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 504 transitions. [2018-11-10 04:55:31,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 04:55:31,042 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:55:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:55:31,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:55:33,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:55:33,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 277 states and 498 transitions. [2018-11-10 04:55:33,055 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 498 transitions. [2018-11-10 04:55:33,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 04:55:33,056 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:55:33,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:55:33,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:55:46,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:55:46,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 288 states and 520 transitions. [2018-11-10 04:55:46,890 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 520 transitions. [2018-11-10 04:55:46,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 04:55:46,890 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:55:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:55:47,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:56:02,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:56:02,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 288 states and 519 transitions. [2018-11-10 04:56:02,885 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 519 transitions. [2018-11-10 04:56:02,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 04:56:02,886 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:56:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:56:02,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:56:03,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:56:03,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 286 states and 516 transitions. [2018-11-10 04:56:03,682 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 516 transitions. [2018-11-10 04:56:03,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 04:56:03,683 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:56:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:56:03,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:56:07,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:56:07,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 290 states and 525 transitions. [2018-11-10 04:56:07,529 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 525 transitions. [2018-11-10 04:56:07,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 04:56:07,530 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:56:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:56:07,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:56:12,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:56:12,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 299 states and 547 transitions. [2018-11-10 04:56:12,799 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 547 transitions. [2018-11-10 04:56:12,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 04:56:12,800 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:56:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:56:12,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:56:18,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:56:18,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 308 states and 565 transitions. [2018-11-10 04:56:18,075 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 565 transitions. [2018-11-10 04:56:18,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 04:56:18,076 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:56:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:56:19,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:56:48,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:56:48,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 327 states and 614 transitions. [2018-11-10 04:56:48,412 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 614 transitions. [2018-11-10 04:56:48,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 04:56:48,412 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:56:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:56:48,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:56:51,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:56:51,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 330 states and 619 transitions. [2018-11-10 04:56:51,406 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 619 transitions. [2018-11-10 04:56:51,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 04:56:51,407 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:56:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:56:51,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:56:53,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:56:53,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 335 states and 633 transitions. [2018-11-10 04:56:53,648 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 633 transitions. [2018-11-10 04:56:53,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 04:56:53,648 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:56:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:56:53,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:56:55,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:56:55,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 336 states and 633 transitions. [2018-11-10 04:56:55,014 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 633 transitions. [2018-11-10 04:56:55,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 04:56:55,015 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:56:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:56:55,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:56:58,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:56:58,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 341 states and 640 transitions. [2018-11-10 04:56:58,924 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 640 transitions. [2018-11-10 04:56:58,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 04:56:58,925 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:56:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:57:00,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:57:09,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:57:09,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 354 states and 666 transitions. [2018-11-10 04:57:09,433 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 666 transitions. [2018-11-10 04:57:09,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 04:57:09,434 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:57:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:57:09,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:57:14,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:57:14,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 358 states and 672 transitions. [2018-11-10 04:57:14,137 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 672 transitions. [2018-11-10 04:57:14,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 04:57:14,137 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:57:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:57:14,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:57:18,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:57:18,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 360 states and 675 transitions. [2018-11-10 04:57:18,833 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 675 transitions. [2018-11-10 04:57:18,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 04:57:18,833 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:57:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:57:18,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:57:27,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:57:27,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 373 states and 703 transitions. [2018-11-10 04:57:27,843 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 703 transitions. [2018-11-10 04:57:27,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 04:57:27,844 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:57:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:57:27,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:57:31,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:57:31,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 372 states and 698 transitions. [2018-11-10 04:57:31,887 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 698 transitions. [2018-11-10 04:57:31,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 04:57:31,887 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:57:31,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:57:31,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:57:36,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:57:36,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 371 states and 692 transitions. [2018-11-10 04:57:36,339 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 692 transitions. [2018-11-10 04:57:36,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 04:57:36,339 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:57:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:57:36,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:57:41,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:57:41,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 370 states and 686 transitions. [2018-11-10 04:57:41,724 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 686 transitions. [2018-11-10 04:57:41,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 04:57:41,725 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:57:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:57:41,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:57:43,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:57:43,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 370 states and 685 transitions. [2018-11-10 04:57:43,041 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 685 transitions. [2018-11-10 04:57:43,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 04:57:43,041 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:57:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:57:43,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:57:44,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:57:44,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 369 states and 682 transitions. [2018-11-10 04:57:44,992 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 682 transitions. [2018-11-10 04:57:44,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 04:57:44,992 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:57:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:57:45,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:57:47,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:57:47,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 368 states and 679 transitions. [2018-11-10 04:57:47,050 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 679 transitions. [2018-11-10 04:57:47,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 04:57:47,050 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:57:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:57:47,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:57:48,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:57:48,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 366 states and 676 transitions. [2018-11-10 04:57:48,136 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 676 transitions. [2018-11-10 04:57:48,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 04:57:48,137 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:57:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:57:48,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:57:50,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:57:50,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 368 states and 678 transitions. [2018-11-10 04:57:50,434 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 678 transitions. [2018-11-10 04:57:50,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 04:57:50,434 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:57:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:57:50,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:57:51,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:57:51,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 346 states and 626 transitions. [2018-11-10 04:57:51,771 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 626 transitions. [2018-11-10 04:57:51,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 04:57:51,771 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:57:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:57:51,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:57:59,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:57:59,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 354 states and 638 transitions. [2018-11-10 04:57:59,759 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 638 transitions. [2018-11-10 04:57:59,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 04:57:59,760 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:57:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:57:59,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:58:02,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:58:02,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 357 states and 644 transitions. [2018-11-10 04:58:02,584 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 644 transitions. [2018-11-10 04:58:02,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 04:58:02,584 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:58:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:58:02,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:58:09,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:58:09,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 367 states and 659 transitions. [2018-11-10 04:58:09,071 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 659 transitions. [2018-11-10 04:58:09,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 04:58:09,071 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:58:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:58:09,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:58:10,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:58:10,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 369 states and 660 transitions. [2018-11-10 04:58:10,944 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 660 transitions. [2018-11-10 04:58:10,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 04:58:10,944 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:58:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:58:10,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:58:11,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:58:11,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 371 states and 664 transitions. [2018-11-10 04:58:11,444 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 664 transitions. [2018-11-10 04:58:11,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 04:58:11,444 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:58:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:58:11,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:58:24,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:58:24,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 388 states and 700 transitions. [2018-11-10 04:58:24,930 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 700 transitions. [2018-11-10 04:58:24,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 04:58:24,931 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:58:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:58:24,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:58:30,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:58:30,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 390 states and 704 transitions. [2018-11-10 04:58:30,574 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 704 transitions. [2018-11-10 04:58:30,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 04:58:30,574 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:58:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:58:30,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:58:40,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:58:40,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 399 states and 717 transitions. [2018-11-10 04:58:40,679 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 717 transitions. [2018-11-10 04:58:40,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 04:58:40,680 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:58:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:58:40,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:58:45,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:58:45,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 402 states and 721 transitions. [2018-11-10 04:58:45,062 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 721 transitions. [2018-11-10 04:58:45,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-10 04:58:45,062 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:58:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:58:45,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:58:52,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:58:52,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 411 states and 738 transitions. [2018-11-10 04:58:52,568 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 738 transitions. [2018-11-10 04:58:52,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-10 04:58:52,568 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:58:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:58:53,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:59:35,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:59:35,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 424 states and 763 transitions. [2018-11-10 04:59:35,739 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 763 transitions. [2018-11-10 04:59:35,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-10 04:59:35,740 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:59:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:59:35,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:59:40,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:59:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 421 states and 758 transitions. [2018-11-10 04:59:40,677 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 758 transitions. [2018-11-10 04:59:40,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-10 04:59:40,678 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:59:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:59:41,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:59:42,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:59:42,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 421 states and 757 transitions. [2018-11-10 04:59:42,989 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 757 transitions. [2018-11-10 04:59:42,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-10 04:59:42,990 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:59:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:59:43,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:59:46,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:59:46,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 424 states and 762 transitions. [2018-11-10 04:59:46,706 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 762 transitions. [2018-11-10 04:59:46,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-10 04:59:46,706 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:59:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:59:46,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:59:48,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:59:48,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 425 states and 762 transitions. [2018-11-10 04:59:48,392 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 762 transitions. [2018-11-10 04:59:48,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-10 04:59:48,392 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:59:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:59:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:59:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:59:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:59:48,638 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 72 iterations. [2018-11-10 04:59:48,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 04:59:48 ImpRootNode [2018-11-10 04:59:48,781 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 04:59:48,781 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:59:48,781 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:59:48,781 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:59:48,782 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:54:46" (3/4) ... [2018-11-10 04:59:48,784 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 04:59:48,884 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_be1ce447-f51f-442c-816e-b54111b25de9/bin-2019/ukojak/witness.graphml [2018-11-10 04:59:48,884 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:59:48,885 INFO L168 Benchmark]: Toolchain (without parser) took 304302.27 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 570.9 MB). Free memory was 956.6 MB in the beginning and 1.0 GB in the end (delta: -48.5 MB). Peak memory consumption was 522.5 MB. Max. memory is 11.5 GB. [2018-11-10 04:59:48,886 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:59:48,886 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.97 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 929.7 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-10 04:59:48,886 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 929.7 MB in the beginning and 1.1 GB in the end (delta: -214.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2018-11-10 04:59:48,886 INFO L168 Benchmark]: Boogie Preprocessor took 34.05 ms. Allocated memory is still 1.2 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. [2018-11-10 04:59:48,887 INFO L168 Benchmark]: RCFGBuilder took 1327.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 931.9 MB in the end (delta: 206.9 MB). Peak memory consumption was 206.9 MB. Max. memory is 11.5 GB. [2018-11-10 04:59:48,887 INFO L168 Benchmark]: CodeCheck took 302387.96 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 420.5 MB). Free memory was 931.9 MB in the beginning and 1.0 GB in the end (delta: -114.6 MB). Peak memory consumption was 305.9 MB. Max. memory is 11.5 GB. [2018-11-10 04:59:48,887 INFO L168 Benchmark]: Witness Printer took 103.52 ms. Allocated memory is still 1.6 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 41.5 MB). Peak memory consumption was 41.5 MB. Max. memory is 11.5 GB. [2018-11-10 04:59:48,888 INFO L336 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, 241 locations, 1 error locations. UNSAFE Result, 302.2s OverallTime, 72 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -1946102592 SDtfs, 1978834940 SDslu, -575180692 SDs, 0 SdLazy, -890772186 SolverSat, -2147397682 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 58.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47893 GetRequests, 46079 SyntacticMatches, 456 SemanticMatches, 1358 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967609 ImplicationChecksByTransitivity, 296.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 5973 NumberOfCodeBlocks, 5973 NumberOfCodeBlocksAsserted, 72 NumberOfCheckSat, 5814 ConstructedInterpolants, 0 QuantifiedInterpolants, 2252807 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 71 InterpolantComputations, 71 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 572]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1] int __return_main; [L13] char p12_old = '\x0'; [L14] char p12_new = '\x0'; [L15] _Bool ep12 = 0; [L17] char p13_old = '\x0'; [L18] char p13_new = '\x0'; [L19] _Bool ep13 = 0; [L21] char p21_old = '\x0'; [L22] char p21_new = '\x0'; [L23] _Bool ep21 = 0; [L25] char p23_old = '\x0'; [L26] char p23_new = '\x0'; [L27] _Bool ep23 = 0; [L29] char p31_old = '\x0'; [L30] char p31_new = '\x0'; [L31] _Bool ep31 = 0; [L33] char p32_old = '\x0'; [L34] char p32_new = '\x0'; [L35] _Bool ep32 = 0; [L36] char id1 = '\x0'; [L37] char r1 = '\x0'; [L38] char st1 = '\x0'; [L39] char nl1 = '\x0'; [L40] char m1 = '\x0'; [L41] char max1 = '\x0'; [L42] _Bool mode1 = 0; [L43] _Bool newmax1 = 0; [L44] char id2 = '\x0'; [L45] char r2 = '\x0'; [L46] char st2 = '\x0'; [L47] char nl2 = '\x0'; [L48] char m2 = '\x0'; [L49] char max2 = '\x0'; [L50] _Bool mode2 = 0; [L51] _Bool newmax2 = 0; [L52] char id3 = '\x0'; [L53] char r3 = '\x0'; [L54] char st3 = '\x0'; [L55] char nl3 = '\x0'; [L56] char m3 = '\x0'; [L57] char max3 = '\x0'; [L58] _Bool mode3 = 0; [L59] _Bool newmax3 = 0; [L67] int __return_1237; [L68] int __return_1383; [L69] int __return_1517; [L70] int __tmp_1518_0; [L71] int __return_1641; [L72] int __return_1531; [L11] msg_t nomsg = (msg_t )-1; [L12] port_t p12 = 0; [L16] port_t p13 = 0; [L20] port_t p21 = 0; [L24] port_t p23 = 0; [L28] port_t p31 = 0; [L32] port_t p32 = 0; [L63] void (*nodes[3])() = { &node1, &node2, &node3 }; [L75] int main__c1; [L76] int main__i2; [L77] main__c1 = 0 [L78] ep12 = __VERIFIER_nondet_bool() [L79] ep13 = __VERIFIER_nondet_bool() [L80] ep21 = __VERIFIER_nondet_bool() [L81] ep23 = __VERIFIER_nondet_bool() [L82] ep31 = __VERIFIER_nondet_bool() [L83] ep32 = __VERIFIER_nondet_bool() [L84] id1 = __VERIFIER_nondet_char() [L85] r1 = __VERIFIER_nondet_char() [L86] st1 = __VERIFIER_nondet_char() [L87] nl1 = __VERIFIER_nondet_char() [L88] m1 = __VERIFIER_nondet_char() [L89] max1 = __VERIFIER_nondet_char() [L90] mode1 = __VERIFIER_nondet_bool() [L91] newmax1 = __VERIFIER_nondet_bool() [L92] id2 = __VERIFIER_nondet_char() [L93] r2 = __VERIFIER_nondet_char() [L94] st2 = __VERIFIER_nondet_char() [L95] nl2 = __VERIFIER_nondet_char() [L96] m2 = __VERIFIER_nondet_char() [L97] max2 = __VERIFIER_nondet_char() [L98] mode2 = __VERIFIER_nondet_bool() [L99] newmax2 = __VERIFIER_nondet_bool() [L100] id3 = __VERIFIER_nondet_char() [L101] r3 = __VERIFIER_nondet_char() [L102] st3 = __VERIFIER_nondet_char() [L103] nl3 = __VERIFIER_nondet_char() [L104] m3 = __VERIFIER_nondet_char() [L105] max3 = __VERIFIER_nondet_char() [L106] mode3 = __VERIFIER_nondet_bool() [L107] newmax3 = __VERIFIER_nondet_bool() [L109] _Bool init__r121; [L110] _Bool init__r131; [L111] _Bool init__r211; [L112] _Bool init__r231; [L113] _Bool init__r311; [L114] _Bool init__r321; [L115] _Bool init__r122; [L116] int init__tmp; [L117] _Bool init__r132; [L118] int init__tmp___0; [L119] _Bool init__r212; [L120] int init__tmp___1; [L121] _Bool init__r232; [L122] int init__tmp___2; [L123] _Bool init__r312; [L124] int init__tmp___3; [L125] _Bool init__r322; [L126] int init__tmp___4; [L127] int init__tmp___5; [L128] init__r121 = ep12 [L129] init__r131 = ep13 [L130] init__r211 = ep21 [L131] init__r231 = ep23 [L132] init__r311 = ep31 [L133] init__r321 = ep32 [L134] COND TRUE !(init__r121 == 0) [L136] init__tmp = 1 [L138] init__r122 = (_Bool)init__tmp [L139] COND FALSE !(!(init__r131 == 0)) [L1741] COND TRUE !(init__r121 == 0) [L1743] COND TRUE !(ep23 == 0) [L1745] init__tmp___0 = 1 [L143] init__r132 = (_Bool)init__tmp___0 [L144] COND FALSE !(!(init__r211 == 0)) [L1718] COND TRUE !(init__r231 == 0) [L1720] COND TRUE !(ep31 == 0) [L1722] init__tmp___1 = 1 [L148] init__r212 = (_Bool)init__tmp___1 [L149] COND TRUE !(init__r231 == 0) [L151] init__tmp___2 = 1 [L153] init__r232 = (_Bool)init__tmp___2 [L154] COND TRUE !(init__r311 == 0) [L156] init__tmp___3 = 1 [L158] init__r312 = (_Bool)init__tmp___3 [L159] COND FALSE !(!(init__r321 == 0)) [L1649] COND TRUE !(init__r311 == 0) [L1651] COND TRUE !(ep12 == 0) [L1653] init__tmp___4 = 1 [L163] init__r322 = (_Bool)init__tmp___4 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L164] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L166] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L168] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L170] COND TRUE ((int)id1) >= 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L172] COND TRUE ((int)id2) >= 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L174] COND TRUE ((int)id3) >= 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L176] COND TRUE ((int)r1) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L178] COND TRUE ((int)r2) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L180] COND TRUE ((int)r3) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L182] COND TRUE !(init__r122 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L184] COND TRUE !(init__r132 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L186] COND TRUE !(init__r212 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L188] COND TRUE !(init__r232 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L190] COND TRUE !(init__r312 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L192] COND TRUE !(init__r322 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L194] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L196] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L198] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L200] COND TRUE ((int)st1) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L202] COND TRUE ((int)st2) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L204] COND TRUE ((int)st3) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L206] COND TRUE ((int)nl1) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L208] COND TRUE ((int)nl2) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L210] COND TRUE ((int)nl3) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L212] COND TRUE ((int)mode1) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, mode1=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L214] COND TRUE ((int)mode2) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, mode1=0, mode2=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L216] COND TRUE ((int)mode3) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L218] COND TRUE !(newmax1 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L220] COND TRUE !(newmax2 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L222] COND TRUE !(newmax3 == 0) [L224] init__tmp___5 = 1 [L225] __return_1237 = init__tmp___5 [L226] main__i2 = __return_1237 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, 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=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L227] COND TRUE main__i2 != 0 [L229] p12_old = nomsg [L230] p12_new = nomsg [L231] p13_old = nomsg [L232] p13_new = nomsg [L233] p21_old = nomsg [L234] p21_new = nomsg [L235] p23_old = nomsg [L236] p23_new = nomsg [L237] p31_old = nomsg [L238] p31_new = nomsg [L239] p32_old = nomsg [L240] p32_new = nomsg [L241] main__i2 = 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, 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] [L242] COND TRUE main__i2 < 6 [L245] _Bool node1__newmax; [L246] node1__newmax = 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, 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] [L247] COND FALSE !(!(mode1 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, 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] [L253] COND TRUE ((int)r1) < 2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, 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] [L255] COND TRUE !(ep12 == 0) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, 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] [L257] COND TRUE !(newmax1 == 0) [L259] int node1____CPAchecker_TMP_0; VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, 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] [L260] COND TRUE max1 != nomsg VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, 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] [L262] COND TRUE p12_new == nomsg [L264] node1____CPAchecker_TMP_0 = max1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, 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] [L266] p12_new = node1____CPAchecker_TMP_0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, 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=127, 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] [L268] COND FALSE !(!(ep13 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, 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=127, 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] [L281] mode1 = 1 [L283] _Bool node2__newmax; [L284] node2__newmax = 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, 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] [L285] COND FALSE !(!(mode2 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, 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] [L291] COND TRUE ((int)r2) < 2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, 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] [L293] COND FALSE !(!(ep21 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, 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] [L306] COND TRUE !(ep23 == 0) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, 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] [L308] COND TRUE !(newmax2 == 0) [L310] int node2____CPAchecker_TMP_1; VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, 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] [L311] COND TRUE max2 != nomsg VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, 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] [L313] COND TRUE p23_new == nomsg [L315] node2____CPAchecker_TMP_1 = max2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, 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] [L317] p23_new = node2____CPAchecker_TMP_1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=2, 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] [L319] mode2 = 1 [L321] _Bool node3__newmax; [L322] node3__newmax = 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=2, 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] [L323] COND FALSE !(!(mode3 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=2, 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] [L329] COND TRUE ((int)r3) < 2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=2, 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] [L331] COND TRUE !(ep31 == 0) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=2, 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] [L333] COND TRUE !(newmax3 == 0) [L335] int node3____CPAchecker_TMP_0; VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=2, 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] [L336] COND TRUE max3 != nomsg VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=2, 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] [L338] COND TRUE p31_new == nomsg [L340] node3____CPAchecker_TMP_0 = max3 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=2, 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] [L342] p31_new = node3____CPAchecker_TMP_0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=2, p23_old=-1, p31=0, p31_new=3, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L344] COND FALSE !(!(ep32 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, max3=3, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=2, p23_old=-1, p31=0, p31_new=3, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L357] mode3 = 1 [L358] p12_old = p12_new [L359] p12_new = nomsg [L360] p13_old = p13_new [L361] p13_new = nomsg [L362] p21_old = p21_new [L363] p21_new = nomsg [L364] p23_old = p23_new [L365] p23_new = nomsg [L366] p31_old = p31_new [L367] p31_new = nomsg [L368] p32_old = p32_new [L369] p32_new = nomsg [L371] int check__tmp; VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, 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=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L372] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, 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=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L374] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, 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=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L376] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, 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=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L378] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, 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=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L380] COND FALSE !(((int)r1) >= 2) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, 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=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L386] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, 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=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L388] COND TRUE ((int)r1) < 2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, 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=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L390] COND FALSE !(((int)r1) >= 2) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, 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=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L396] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, 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=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L398] COND TRUE ((int)r1) < 2 [L400] check__tmp = 1 [L401] __return_1383 = check__tmp [L402] main__c1 = __return_1383 [L404] _Bool __tmp_1; [L405] __tmp_1 = main__c1 [L406] _Bool assert__arg; [L407] assert__arg = __tmp_1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, 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=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L408] COND FALSE !(assert__arg == 0) [L414] int main____CPAchecker_TMP_0 = main__i2; [L415] main__i2 = main__i2 + 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, 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=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L416] COND TRUE main__i2 < 6 [L419] _Bool node1__newmax; [L420] node1__newmax = 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=2, m2=-128, m3=-128, max1=127, max2=2, 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=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L421] COND TRUE !(mode1 == 0) [L423] r1 = (char)(((int)r1) + 1) [L424] COND FALSE !(!(ep21 == 0)) [L433] COND TRUE !(ep31 == 0) [L435] m1 = p31_old [L436] p31_old = nomsg [L437] COND FALSE !(((int)m1) > ((int)max1)) [L442] newmax1 = node1__newmax VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=3, m2=-128, m3=-128, max1=127, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L443] COND TRUE ((int)r1) == 1 [L445] COND TRUE ((int)max1) == ((int)id1) [L447] st1 = 1 [L449] mode1 = 0 [L451] _Bool node2__newmax; [L452] node2__newmax = 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=3, m2=-128, m3=-128, max1=127, max2=2, max3=3, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L453] COND TRUE !(mode2 == 0) [L455] r2 = (char)(((int)r2) + 1) [L456] COND TRUE !(ep12 == 0) [L458] m2 = p12_old [L459] p12_old = nomsg [L460] COND TRUE ((int)m2) > ((int)max2) [L462] max2 = m2 [L463] node2__newmax = 1 [L465] COND FALSE !(!(ep32 == 0)) [L474] newmax2 = node2__newmax VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=3, m2=127, m3=-128, max1=127, max2=127, max3=3, mode1=0, mode2=1, mode3=1, newmax1=0, 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=2, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L475] COND FALSE !(((int)r2) == 2) [L481] mode2 = 0 [L483] _Bool node3__newmax; [L484] node3__newmax = 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=3, m2=127, m3=-128, max1=127, max2=127, max3=3, mode1=0, mode2=0, mode3=1, newmax1=0, 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=2, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L485] COND TRUE !(mode3 == 0) [L487] r3 = (char)(((int)r3) + 1) [L488] COND FALSE !(!(ep13 == 0)) [L497] COND TRUE !(ep23 == 0) [L499] m3 = p23_old [L500] p23_old = nomsg [L501] COND FALSE !(((int)m3) > ((int)max3)) [L506] newmax3 = node3__newmax VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=3, m2=127, m3=2, max1=127, max2=127, max3=3, mode1=0, mode2=0, mode3=1, newmax1=0, 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=1, st2=0, st3=0] [L507] COND FALSE !(((int)r3) == 2) [L513] mode3 = 0 [L514] p12_old = p12_new [L515] p12_new = nomsg [L516] p13_old = p13_new [L517] p13_new = nomsg [L518] p21_old = p21_new [L519] p21_new = nomsg [L520] p23_old = p23_new [L521] p23_new = nomsg [L522] p31_old = p31_new [L523] p31_new = nomsg [L524] p32_old = p32_new [L525] p32_new = nomsg [L527] int check__tmp; VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=3, m2=127, m3=2, max1=127, max2=127, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, 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=1, st2=0, st3=0] [L528] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=3, m2=127, m3=2, max1=127, max2=127, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, 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=1, st2=0, st3=0] [L530] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=3, m2=127, m3=2, max1=127, max2=127, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, 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=1, st2=0, st3=0] [L532] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=3, m2=127, m3=2, max1=127, max2=127, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, 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=1, st2=0, st3=0] [L534] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=3, m2=127, m3=2, max1=127, max2=127, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, 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=1, st2=0, st3=0] [L536] COND FALSE !(((int)r1) >= 2) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=3, m2=127, m3=2, max1=127, max2=127, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, 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=1, st2=0, st3=0] [L542] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 0) [L1167] check__tmp = 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=3, m2=127, m3=2, max1=127, max2=127, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, 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=1, st2=0, st3=0] [L560] __return_1517 = check__tmp [L561] main__c1 = __return_1517 [L562] __tmp_1518_0 = main____CPAchecker_TMP_0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=3, m2=127, m3=2, max1=127, max2=127, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, 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=1, st2=0, st3=0] [L564] main____CPAchecker_TMP_0 = __tmp_1518_0 [L566] _Bool __tmp_2; [L567] __tmp_2 = main__c1 [L568] _Bool assert__arg; [L569] assert__arg = __tmp_2 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=3, m2=127, m3=2, max1=127, max2=127, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, 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=1, st2=0, st3=0] [L570] COND TRUE assert__arg == 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=3, m2=127, m3=2, max1=127, max2=127, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, 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=1, st2=0, st3=0] [L572] __VERIFIER_error() VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=2, id3=3, m1=3, m2=127, m3=2, max1=127, max2=127, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, 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=1, st2=0, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 352.97 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 929.7 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 93.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 929.7 MB in the beginning and 1.1 GB in the end (delta: -214.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.05 ms. Allocated memory is still 1.2 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. * RCFGBuilder took 1327.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 931.9 MB in the end (delta: 206.9 MB). Peak memory consumption was 206.9 MB. Max. memory is 11.5 GB. * CodeCheck took 302387.96 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 420.5 MB). Free memory was 931.9 MB in the beginning and 1.0 GB in the end (delta: -114.6 MB). Peak memory consumption was 305.9 MB. Max. memory is 11.5 GB. * Witness Printer took 103.52 ms. Allocated memory is still 1.6 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 41.5 MB). Peak memory consumption was 41.5 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...