./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e5adeb65-2499-4cae-8e2f-c399131389fa/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e5adeb65-2499-4cae-8e2f-c399131389fa/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e5adeb65-2499-4cae-8e2f-c399131389fa/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e5adeb65-2499-4cae-8e2f-c399131389fa/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e5adeb65-2499-4cae-8e2f-c399131389fa/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e5adeb65-2499-4cae-8e2f-c399131389fa/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 4fc1e09d0a185b5e28aca558590d685af7160ef3 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-635dfa2 [2018-12-09 12:50:36,422 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 12:50:36,423 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 12:50:36,429 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 12:50:36,429 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 12:50:36,430 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 12:50:36,430 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 12:50:36,431 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 12:50:36,432 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 12:50:36,432 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 12:50:36,432 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 12:50:36,433 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 12:50:36,433 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 12:50:36,433 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 12:50:36,434 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 12:50:36,434 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 12:50:36,435 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 12:50:36,436 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 12:50:36,436 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 12:50:36,437 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 12:50:36,438 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 12:50:36,438 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 12:50:36,439 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 12:50:36,439 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 12:50:36,439 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 12:50:36,440 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 12:50:36,440 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 12:50:36,441 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 12:50:36,441 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 12:50:36,442 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 12:50:36,442 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 12:50:36,442 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 12:50:36,442 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 12:50:36,442 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 12:50:36,443 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 12:50:36,443 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 12:50:36,443 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e5adeb65-2499-4cae-8e2f-c399131389fa/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-09 12:50:36,450 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 12:50:36,450 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 12:50:36,451 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 12:50:36,451 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-09 12:50:36,451 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 12:50:36,451 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 12:50:36,451 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 12:50:36,452 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 12:50:36,452 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 12:50:36,452 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 12:50:36,452 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 12:50:36,452 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 12:50:36,452 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 12:50:36,452 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 12:50:36,452 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 12:50:36,452 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 12:50:36,452 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 12:50:36,452 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 12:50:36,453 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-09 12:50:36,453 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-09 12:50:36,453 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 12:50:36,453 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 12:50:36,453 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-09 12:50:36,453 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 12:50:36,453 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 12:50:36,453 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 12:50:36,453 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-09 12:50:36,453 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 12:50:36,453 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 12:50:36,454 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_e5adeb65-2499-4cae-8e2f-c399131389fa/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 -> 4fc1e09d0a185b5e28aca558590d685af7160ef3 [2018-12-09 12:50:36,470 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 12:50:36,477 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 12:50:36,479 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 12:50:36,480 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 12:50:36,480 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 12:50:36,481 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e5adeb65-2499-4cae-8e2f-c399131389fa/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2018-12-09 12:50:36,516 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e5adeb65-2499-4cae-8e2f-c399131389fa/bin-2019/ukojak/data/4c89cb1eb/08c99c67fb3846a2b92d51e540b1cb32/FLAGe6d14d1b5 [2018-12-09 12:50:36,885 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 12:50:36,886 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e5adeb65-2499-4cae-8e2f-c399131389fa/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3_false-unreach-call.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2018-12-09 12:50:36,892 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e5adeb65-2499-4cae-8e2f-c399131389fa/bin-2019/ukojak/data/4c89cb1eb/08c99c67fb3846a2b92d51e540b1cb32/FLAGe6d14d1b5 [2018-12-09 12:50:36,900 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e5adeb65-2499-4cae-8e2f-c399131389fa/bin-2019/ukojak/data/4c89cb1eb/08c99c67fb3846a2b92d51e540b1cb32 [2018-12-09 12:50:36,902 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 12:50:36,903 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 12:50:36,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 12:50:36,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 12:50:36,906 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 12:50:36,906 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:50:36" (1/1) ... [2018-12-09 12:50:36,908 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f5a6cc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:50:36, skipping insertion in model container [2018-12-09 12:50:36,908 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:50:36" (1/1) ... [2018-12-09 12:50:36,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 12:50:36,940 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 12:50:37,112 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:50:37,120 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 12:50:37,215 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:50:37,225 INFO L195 MainTranslator]: Completed translation [2018-12-09 12:50:37,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:50:37 WrapperNode [2018-12-09 12:50:37,225 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 12:50:37,226 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 12:50:37,226 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 12:50:37,226 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 12:50:37,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:50:37" (1/1) ... [2018-12-09 12:50:37,238 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:50:37" (1/1) ... [2018-12-09 12:50:37,260 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 12:50:37,260 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 12:50:37,260 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 12:50:37,260 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 12:50:37,266 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:50:37" (1/1) ... [2018-12-09 12:50:37,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:50:37" (1/1) ... [2018-12-09 12:50:37,268 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:50:37" (1/1) ... [2018-12-09 12:50:37,268 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:50:37" (1/1) ... [2018-12-09 12:50:37,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:50:37" (1/1) ... [2018-12-09 12:50:37,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:50:37" (1/1) ... [2018-12-09 12:50:37,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:50:37" (1/1) ... [2018-12-09 12:50:37,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 12:50:37,283 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 12:50:37,283 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 12:50:37,283 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 12:50:37,284 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:50:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5adeb65-2499-4cae-8e2f-c399131389fa/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-12-09 12:50:37,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 12:50:37,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 12:50:38,269 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 12:50:38,269 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-09 12:50:38,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:50:38 BoogieIcfgContainer [2018-12-09 12:50:38,269 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 12:50:38,270 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-09 12:50:38,270 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-09 12:50:38,277 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-09 12:50:38,277 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:50:38" (1/1) ... [2018-12-09 12:50:38,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:50:38,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:50:38,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 173 states and 303 transitions. [2018-12-09 12:50:38,309 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 303 transitions. [2018-12-09 12:50:38,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-09 12:50:38,312 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:50:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:50:38,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:50:38,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:50:38,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 184 states and 329 transitions. [2018-12-09 12:50:38,808 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 329 transitions. [2018-12-09 12:50:38,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 12:50:38,809 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:50:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:50:38,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:50:39,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:50:39,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 186 states and 333 transitions. [2018-12-09 12:50:39,024 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 333 transitions. [2018-12-09 12:50:39,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 12:50:39,025 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:50:39,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:50:39,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:50:39,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:50:39,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 197 states and 360 transitions. [2018-12-09 12:50:39,462 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 360 transitions. [2018-12-09 12:50:39,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 12:50:39,464 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:50:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:50:39,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:50:39,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:50:39,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 199 states and 362 transitions. [2018-12-09 12:50:39,509 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 362 transitions. [2018-12-09 12:50:39,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 12:50:39,510 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:50:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:50:39,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:50:40,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:50:40,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 206 states and 380 transitions. [2018-12-09 12:50:40,260 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 380 transitions. [2018-12-09 12:50:40,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 12:50:40,261 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:50:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:50:40,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:50:40,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:50:40,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 207 states and 381 transitions. [2018-12-09 12:50:40,295 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 381 transitions. [2018-12-09 12:50:40,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 12:50:40,296 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:50:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:50:40,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:50:40,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:50:40,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 207 states and 379 transitions. [2018-12-09 12:50:40,331 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 379 transitions. [2018-12-09 12:50:40,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 12:50:40,332 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:50:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:50:40,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:50:44,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:50:44,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 210 states and 387 transitions. [2018-12-09 12:50:44,338 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 387 transitions. [2018-12-09 12:50:44,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 12:50:44,339 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:50:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:50:44,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:50:44,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:50:44,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 214 states and 393 transitions. [2018-12-09 12:50:44,836 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 393 transitions. [2018-12-09 12:50:44,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 12:50:44,837 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:50:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:50:44,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:50:49,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:50:49,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 226 states and 423 transitions. [2018-12-09 12:50:49,794 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 423 transitions. [2018-12-09 12:50:49,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 12:50:49,795 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:50:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:50:50,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:50:55,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:50:55,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 235 states and 442 transitions. [2018-12-09 12:50:55,688 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 442 transitions. [2018-12-09 12:50:55,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 12:50:55,688 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:50:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:50:56,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:51:07,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:51:07,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 241 states and 456 transitions. [2018-12-09 12:51:07,698 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 456 transitions. [2018-12-09 12:51:07,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 12:51:07,698 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:51:07,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:51:07,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:51:18,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:51:18,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 249 states and 477 transitions. [2018-12-09 12:51:18,119 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 477 transitions. [2018-12-09 12:51:18,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 12:51:18,120 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:51:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:51:18,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:51:19,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:51:19,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 253 states and 483 transitions. [2018-12-09 12:51:19,324 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 483 transitions. [2018-12-09 12:51:19,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 12:51:19,324 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:51:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:51:19,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-12-09 12:51:19,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:51:19,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 257 states and 491 transitions. [2018-12-09 12:51:19,937 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 491 transitions. [2018-12-09 12:51:19,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 12:51:19,937 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:51:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:51:19,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:51:20,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:51:20,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 259 states and 496 transitions. [2018-12-09 12:51:20,559 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 496 transitions. [2018-12-09 12:51:20,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 12:51:20,559 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:51:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:51:20,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:51:20,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:51:20,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 259 states and 495 transitions. [2018-12-09 12:51:20,624 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 495 transitions. [2018-12-09 12:51:20,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 12:51:20,625 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:51:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:51:20,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:51:26,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:51:26,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 266 states and 514 transitions. [2018-12-09 12:51:26,100 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 514 transitions. [2018-12-09 12:51:26,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 12:51:26,100 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:51:26,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:51:26,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:51:29,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:51:29,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 270 states and 522 transitions. [2018-12-09 12:51:29,049 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 522 transitions. [2018-12-09 12:51:29,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 12:51:29,050 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:51:29,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:51:29,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:51:32,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:51:32,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 274 states and 528 transitions. [2018-12-09 12:51:32,104 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 528 transitions. [2018-12-09 12:51:32,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 12:51:32,105 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:51:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:51:32,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:51:37,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:51:37,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 278 states and 537 transitions. [2018-12-09 12:51:37,005 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 537 transitions. [2018-12-09 12:51:37,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 12:51:37,005 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:51:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:51:37,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:51:38,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:51:38,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 282 states and 543 transitions. [2018-12-09 12:51:38,173 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 543 transitions. [2018-12-09 12:51:38,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 12:51:38,173 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:51:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:51:38,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:51:43,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:51:43,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 291 states and 564 transitions. [2018-12-09 12:51:43,727 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 564 transitions. [2018-12-09 12:51:43,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 12:51:43,728 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:51:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:51:43,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:51:44,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:51:44,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 293 states and 569 transitions. [2018-12-09 12:51:44,269 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 569 transitions. [2018-12-09 12:51:44,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 12:51:44,270 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:51:44,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:51:44,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:51:45,715 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-09 12:51:50,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:51:50,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 301 states and 591 transitions. [2018-12-09 12:51:50,897 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 591 transitions. [2018-12-09 12:51:50,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 12:51:50,897 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:51:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:51:50,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:51:52,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:51:52,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 305 states and 596 transitions. [2018-12-09 12:51:52,502 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 596 transitions. [2018-12-09 12:51:52,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 12:51:52,502 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:51:52,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:51:52,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:51:55,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:51:55,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 306 states and 600 transitions. [2018-12-09 12:51:55,621 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 600 transitions. [2018-12-09 12:51:55,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 12:51:55,621 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:51:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:51:55,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:51:57,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:51:57,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 308 states and 604 transitions. [2018-12-09 12:51:57,358 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 604 transitions. [2018-12-09 12:51:57,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 12:51:57,358 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:51:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:51:57,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:52:01,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:52:01,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 309 states and 606 transitions. [2018-12-09 12:52:01,786 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 606 transitions. [2018-12-09 12:52:01,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 12:52:01,787 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:52:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:52:01,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:52:05,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:52:05,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 315 states and 619 transitions. [2018-12-09 12:52:05,317 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 619 transitions. [2018-12-09 12:52:05,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 12:52:05,318 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:52:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:52:05,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:52:13,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:52:13,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 298 states and 555 transitions. [2018-12-09 12:52:13,133 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 555 transitions. [2018-12-09 12:52:13,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 12:52:13,134 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:52:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:52:13,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:52:13,734 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-12-09 12:52:18,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:52:18,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 302 states and 562 transitions. [2018-12-09 12:52:18,316 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 562 transitions. [2018-12-09 12:52:18,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 12:52:18,316 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:52:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:52:19,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:52:56,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:52:56,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 316 states and 597 transitions. [2018-12-09 12:52:56,070 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 597 transitions. [2018-12-09 12:52:56,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 12:52:56,070 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:52:56,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:52:56,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:06,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:53:06,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 324 states and 612 transitions. [2018-12-09 12:53:06,190 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 612 transitions. [2018-12-09 12:53:06,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 12:53:06,191 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:53:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:06,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:10,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:53:10,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 328 states and 617 transitions. [2018-12-09 12:53:10,886 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 617 transitions. [2018-12-09 12:53:10,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 12:53:10,886 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:53:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:10,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-12-09 12:53:20,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:53:20,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 337 states and 635 transitions. [2018-12-09 12:53:20,994 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 635 transitions. [2018-12-09 12:53:20,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 12:53:20,995 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:53:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:21,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:26,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:53:26,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 341 states and 640 transitions. [2018-12-09 12:53:26,267 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 640 transitions. [2018-12-09 12:53:26,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 12:53:26,267 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:53:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:26,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:28,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:53:28,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 345 states and 645 transitions. [2018-12-09 12:53:28,292 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 645 transitions. [2018-12-09 12:53:28,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 12:53:28,292 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:53:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:28,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:33,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:53:33,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 349 states and 655 transitions. [2018-12-09 12:53:33,907 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 655 transitions. [2018-12-09 12:53:33,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 12:53:33,907 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:53:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:33,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:37,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:53:37,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 353 states and 660 transitions. [2018-12-09 12:53:37,679 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 660 transitions. [2018-12-09 12:53:37,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 12:53:37,679 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:53:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:37,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:39,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:53:39,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 355 states and 661 transitions. [2018-12-09 12:53:39,581 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 661 transitions. [2018-12-09 12:53:39,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 12:53:39,581 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:53:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:39,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:42,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:53:42,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 363 states and 677 transitions. [2018-12-09 12:53:42,804 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 677 transitions. [2018-12-09 12:53:42,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 12:53:42,805 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:53:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:42,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:52,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:53:52,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 368 states and 684 transitions. [2018-12-09 12:53:52,259 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 684 transitions. [2018-12-09 12:53:52,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 12:53:52,259 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:53:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:52,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:53:58,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:53:58,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 363 states and 673 transitions. [2018-12-09 12:53:58,008 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 673 transitions. [2018-12-09 12:53:58,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 12:53:58,009 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:53:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:53:58,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-12-09 12:54:04,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:54:04,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 365 states and 675 transitions. [2018-12-09 12:54:04,056 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 675 transitions. [2018-12-09 12:54:04,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 12:54:04,057 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:54:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:54:04,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:54:20,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:54:20,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 375 states and 695 transitions. [2018-12-09 12:54:20,269 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 695 transitions. [2018-12-09 12:54:20,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 12:54:20,270 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:54:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:54:20,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:54:24,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:54:24,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 377 states and 700 transitions. [2018-12-09 12:54:24,765 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 700 transitions. [2018-12-09 12:54:24,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 12:54:24,765 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:54:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:54:24,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:54:26,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:54:26,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 375 states and 697 transitions. [2018-12-09 12:54:26,132 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 697 transitions. [2018-12-09 12:54:26,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 12:54:26,133 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:54:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:54:27,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-12-09 12:55:05,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:55:05,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 384 states and 713 transitions. [2018-12-09 12:55:05,488 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 713 transitions. [2018-12-09 12:55:05,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 12:55:05,488 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:55:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:55:05,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:55:10,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:55:10,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 389 states and 721 transitions. [2018-12-09 12:55:10,179 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 721 transitions. [2018-12-09 12:55:10,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 12:55:10,179 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:55:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:55:10,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:55:11,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:55:11,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 386 states and 710 transitions. [2018-12-09 12:55:11,574 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 710 transitions. [2018-12-09 12:55:11,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 12:55:11,574 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:55:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:55:11,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:55:13,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:55:13,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 386 states and 707 transitions. [2018-12-09 12:55:13,076 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 707 transitions. [2018-12-09 12:55:13,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 12:55:13,076 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:55:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:55:13,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:55:14,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:55:14,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 386 states and 706 transitions. [2018-12-09 12:55:14,600 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 706 transitions. [2018-12-09 12:55:14,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 12:55:14,600 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:55:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:55:14,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:55:16,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:55:16,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 386 states and 704 transitions. [2018-12-09 12:55:16,165 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 704 transitions. [2018-12-09 12:55:16,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 12:55:16,165 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:55:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:55:16,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:55:22,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:55:22,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 390 states and 710 transitions. [2018-12-09 12:55:22,211 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 710 transitions. [2018-12-09 12:55:22,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 12:55:22,211 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:55:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:55:22,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:55:28,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:55:28,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 394 states and 716 transitions. [2018-12-09 12:55:28,321 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 716 transitions. [2018-12-09 12:55:28,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 12:55:28,321 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:55:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:55:28,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:55:49,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:55:49,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 411 states and 752 transitions. [2018-12-09 12:55:49,787 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 752 transitions. [2018-12-09 12:55:49,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 12:55:49,788 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:55:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:55:49,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:55:51,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:55:51,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 413 states and 755 transitions. [2018-12-09 12:55:51,770 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 755 transitions. [2018-12-09 12:55:51,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 12:55:51,770 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:55:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:55:51,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:55:53,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:55:53,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 417 states and 762 transitions. [2018-12-09 12:55:53,688 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 762 transitions. [2018-12-09 12:55:53,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 12:55:53,689 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:55:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:55:53,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:56:01,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:56:01,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 426 states and 779 transitions. [2018-12-09 12:56:01,202 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 779 transitions. [2018-12-09 12:56:01,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 12:56:01,203 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:56:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:56:01,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:56:11,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:56:11,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 433 states and 791 transitions. [2018-12-09 12:56:11,928 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 791 transitions. [2018-12-09 12:56:11,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 12:56:11,929 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:56:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:56:11,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:56:15,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:56:15,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 435 states and 792 transitions. [2018-12-09 12:56:15,390 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 792 transitions. [2018-12-09 12:56:15,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 12:56:15,391 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:56:15,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:56:15,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:56:22,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:56:22,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 432 states and 786 transitions. [2018-12-09 12:56:22,158 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 786 transitions. [2018-12-09 12:56:22,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 12:56:22,159 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:56:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:56:22,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:56:28,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:56:28,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 434 states and 791 transitions. [2018-12-09 12:56:28,760 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 791 transitions. [2018-12-09 12:56:28,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 12:56:28,761 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:56:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:56:28,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:56:36,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:56:36,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 428 states and 782 transitions. [2018-12-09 12:56:36,006 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 782 transitions. [2018-12-09 12:56:36,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 12:56:36,007 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:56:36,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:56:36,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:56:38,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:56:38,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 426 states and 776 transitions. [2018-12-09 12:56:38,822 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 776 transitions. [2018-12-09 12:56:38,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 12:56:38,822 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:56:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:56:38,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:56:53,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:56:53,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 437 states and 800 transitions. [2018-12-09 12:56:53,667 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 800 transitions. [2018-12-09 12:56:53,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 12:56:53,668 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:56:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:56:53,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:56:57,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:56:57,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 435 states and 794 transitions. [2018-12-09 12:56:57,171 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 794 transitions. [2018-12-09 12:56:57,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 12:56:57,171 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:56:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:56:57,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:57:03,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:57:03,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 434 states and 787 transitions. [2018-12-09 12:57:03,683 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 787 transitions. [2018-12-09 12:57:03,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 12:57:03,683 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:57:03,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:03,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:57:11,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:57:11,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 436 states and 790 transitions. [2018-12-09 12:57:11,962 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 790 transitions. [2018-12-09 12:57:11,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 12:57:11,962 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:57:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:11,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:57:13,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:57:13,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 437 states and 791 transitions. [2018-12-09 12:57:13,577 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 791 transitions. [2018-12-09 12:57:13,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 12:57:13,577 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:57:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:13,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:57:15,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:57:15,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 437 states and 790 transitions. [2018-12-09 12:57:15,368 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 790 transitions. [2018-12-09 12:57:15,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 12:57:15,369 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:57:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:15,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:57:15,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:57:15,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 439 states and 794 transitions. [2018-12-09 12:57:15,972 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 794 transitions. [2018-12-09 12:57:15,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 12:57:15,973 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:57:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:15,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:57:17,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:57:17,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 439 states and 793 transitions. [2018-12-09 12:57:17,888 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 793 transitions. [2018-12-09 12:57:17,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 12:57:17,889 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:57:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:17,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:57:26,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:57:26,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 446 states and 806 transitions. [2018-12-09 12:57:26,811 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 806 transitions. [2018-12-09 12:57:26,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 12:57:26,812 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:57:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:26,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-12-09 12:57:29,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:57:29,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 444 states and 803 transitions. [2018-12-09 12:57:29,827 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 803 transitions. [2018-12-09 12:57:29,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 12:57:29,828 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:57:29,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:29,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-12-09 12:57:31,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:57:31,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 444 states and 802 transitions. [2018-12-09 12:57:31,710 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 802 transitions. [2018-12-09 12:57:31,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 12:57:31,710 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:57:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:31,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:57:33,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:57:33,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 441 states and 797 transitions. [2018-12-09 12:57:33,581 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 797 transitions. [2018-12-09 12:57:33,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 12:57:33,581 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:57:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:33,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:57:37,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:57:37,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 398 states and 698 transitions. [2018-12-09 12:57:37,319 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 698 transitions. [2018-12-09 12:57:37,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 12:57:37,320 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:57:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:37,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:57:46,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:57:46,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 403 states and 706 transitions. [2018-12-09 12:57:46,052 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 706 transitions. [2018-12-09 12:57:46,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 12:57:46,052 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:57:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:46,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:57:57,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:57:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 411 states and 718 transitions. [2018-12-09 12:57:57,898 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 718 transitions. [2018-12-09 12:57:57,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-09 12:57:57,898 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:57:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:57:59,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:58:28,493 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2018-12-09 12:58:55,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 12:58:55,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 420 states and 731 transitions. [2018-12-09 12:58:55,733 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 731 transitions. [2018-12-09 12:58:55,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-09 12:58:55,734 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 12:58:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:58:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:58:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:58:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:58:55,946 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 83 iterations. [2018-12-09 12:58:56,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.12 12:58:56 ImpRootNode [2018-12-09 12:58:56,056 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-09 12:58:56,056 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 12:58:56,056 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 12:58:56,056 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 12:58:56,056 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:50:38" (3/4) ... [2018-12-09 12:58:56,058 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 12:58:56,146 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e5adeb65-2499-4cae-8e2f-c399131389fa/bin-2019/ukojak/witness.graphml [2018-12-09 12:58:56,147 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 12:58:56,147 INFO L168 Benchmark]: Toolchain (without parser) took 499244.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 949.5 MB in the beginning and 742.7 MB in the end (delta: 206.8 MB). Peak memory consumption was 353.6 MB. Max. memory is 11.5 GB. [2018-12-09 12:58:56,147 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:58:56,148 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -164.9 MB). Peak memory consumption was 33.5 MB. Max. memory is 11.5 GB. [2018-12-09 12:58:56,148 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.02 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-12-09 12:58:56,148 INFO L168 Benchmark]: Boogie Preprocessor took 22.84 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 12:58:56,148 INFO L168 Benchmark]: RCFGBuilder took 986.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 879.4 MB in the end (delta: 226.9 MB). Peak memory consumption was 226.9 MB. Max. memory is 11.5 GB. [2018-12-09 12:58:56,148 INFO L168 Benchmark]: CodeCheck took 497786.18 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24.1 MB). Free memory was 879.4 MB in the beginning and 780.4 MB in the end (delta: 99.0 MB). Peak memory consumption was 123.1 MB. Max. memory is 11.5 GB. [2018-12-09 12:58:56,149 INFO L168 Benchmark]: Witness Printer took 90.59 ms. Allocated memory is still 1.2 GB. Free memory was 780.4 MB in the beginning and 742.7 MB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. [2018-12-09 12:58:56,150 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, 247 locations, 1 error locations. UNSAFE Result, 497.6s OverallTime, 83 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 907676848 SDtfs, 871027146 SDslu, -1757595098 SDs, 0 SdLazy, 2003338600 SolverSat, 1811948048 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 112.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56135 GetRequests, 54170 SyntacticMatches, 537 SemanticMatches, 1428 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029775 ImplicationChecksByTransitivity, 490.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 6957 NumberOfCodeBlocks, 6957 NumberOfCodeBlocksAsserted, 83 NumberOfCheckSat, 6786 ConstructedInterpolants, 0 QuantifiedInterpolants, 2288925 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 82 InterpolantComputations, 82 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: 581]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1] int __return_main; [L12] msg_t nomsg = (msg_t )-1; [L13] port_t p12 = 0; [L14] char p12_old = '\x0'; [L15] char p12_new = '\x0'; [L16] _Bool ep12 = 0; [L17] port_t p13 = 0; [L18] char p13_old = '\x0'; [L19] char p13_new = '\x0'; [L20] _Bool ep13 = 0; [L21] port_t p21 = 0; [L22] char p21_old = '\x0'; [L23] char p21_new = '\x0'; [L24] _Bool ep21 = 0; [L25] port_t p23 = 0; [L26] char p23_old = '\x0'; [L27] char p23_new = '\x0'; [L28] _Bool ep23 = 0; [L29] port_t p31 = 0; [L30] char p31_old = '\x0'; [L31] char p31_new = '\x0'; [L32] _Bool ep31 = 0; [L33] port_t p32 = 0; [L34] char p32_old = '\x0'; [L35] char p32_new = '\x0'; [L36] _Bool ep32 = 0; [L37] char id1 = '\x0'; [L38] unsigned char r1 = '\x0'; [L39] char st1 = '\x0'; [L40] char nl1 = '\x0'; [L41] char m1 = '\x0'; [L42] char max1 = '\x0'; [L43] _Bool mode1 = 0; [L44] _Bool newmax1 = 0; [L45] char id2 = '\x0'; [L46] unsigned char r2 = '\x0'; [L47] char st2 = '\x0'; [L48] char nl2 = '\x0'; [L49] char m2 = '\x0'; [L50] char max2 = '\x0'; [L51] _Bool mode2 = 0; [L52] _Bool newmax2 = 0; [L53] char id3 = '\x0'; [L54] unsigned char r3 = '\x0'; [L55] char st3 = '\x0'; [L56] char nl3 = '\x0'; [L57] char m3 = '\x0'; [L58] char max3 = '\x0'; [L59] _Bool mode3 = 0; [L60] _Bool newmax3 = 0; [L64] void (*nodes[3])() = { &node1, &node2, &node3 }; [L68] int __return_1248; [L69] int __return_1394; [L70] int __return_1528; [L71] int __return_1653; [L74] int main__c1; [L75] int main__i2; [L76] main__c1 = 0 [L77] ep12 = __VERIFIER_nondet_bool() [L78] ep13 = __VERIFIER_nondet_bool() [L79] ep21 = __VERIFIER_nondet_bool() [L80] ep23 = __VERIFIER_nondet_bool() [L81] ep31 = __VERIFIER_nondet_bool() [L82] ep32 = __VERIFIER_nondet_bool() [L83] id1 = __VERIFIER_nondet_char() [L84] r1 = __VERIFIER_nondet_uchar() [L85] st1 = __VERIFIER_nondet_char() [L86] nl1 = __VERIFIER_nondet_char() [L87] m1 = __VERIFIER_nondet_char() [L88] max1 = __VERIFIER_nondet_char() [L89] mode1 = __VERIFIER_nondet_bool() [L90] newmax1 = __VERIFIER_nondet_bool() [L91] id2 = __VERIFIER_nondet_char() [L92] r2 = __VERIFIER_nondet_uchar() [L93] st2 = __VERIFIER_nondet_char() [L94] nl2 = __VERIFIER_nondet_char() [L95] m2 = __VERIFIER_nondet_char() [L96] max2 = __VERIFIER_nondet_char() [L97] mode2 = __VERIFIER_nondet_bool() [L98] newmax2 = __VERIFIER_nondet_bool() [L99] id3 = __VERIFIER_nondet_char() [L100] r3 = __VERIFIER_nondet_uchar() [L101] st3 = __VERIFIER_nondet_char() [L102] nl3 = __VERIFIER_nondet_char() [L103] m3 = __VERIFIER_nondet_char() [L104] max3 = __VERIFIER_nondet_char() [L105] mode3 = __VERIFIER_nondet_bool() [L106] newmax3 = __VERIFIER_nondet_bool() [L108] _Bool init__r121; [L109] _Bool init__r131; [L110] _Bool init__r211; [L111] _Bool init__r231; [L112] _Bool init__r311; [L113] _Bool init__r321; [L114] _Bool init__r122; [L115] int init__tmp; [L116] _Bool init__r132; [L117] int init__tmp___0; [L118] _Bool init__r212; [L119] int init__tmp___1; [L120] _Bool init__r232; [L121] int init__tmp___2; [L122] _Bool init__r312; [L123] int init__tmp___3; [L124] _Bool init__r322; [L125] int init__tmp___4; [L126] int init__tmp___5; [L127] init__r121 = ep12 [L128] init__r131 = ep13 [L129] init__r211 = ep21 [L130] init__r231 = ep23 [L131] init__r311 = ep31 [L132] init__r321 = ep32 [L133] COND FALSE !(!(init__r121 == 0)) [L1782] COND TRUE !(init__r131 == 0) [L1784] COND TRUE !(ep32 == 0) [L1786] init__tmp = 1 [L137] init__r122 = (_Bool)init__tmp [L138] COND TRUE !(init__r131 == 0) [L140] init__tmp___0 = 1 [L142] init__r132 = (_Bool)init__tmp___0 [L143] COND TRUE !(init__r211 == 0) [L145] init__tmp___1 = 1 [L147] init__r212 = (_Bool)init__tmp___1 [L148] COND FALSE !(!(init__r231 == 0)) [L1713] COND TRUE !(init__r211 == 0) [L1715] COND TRUE !(ep13 == 0) [L1717] init__tmp___2 = 1 [L152] init__r232 = (_Bool)init__tmp___2 [L153] COND FALSE !(!(init__r311 == 0)) [L1690] COND TRUE !(init__r321 == 0) [L1692] COND TRUE !(ep21 == 0) [L1694] init__tmp___3 = 1 [L157] init__r312 = (_Bool)init__tmp___3 [L158] COND TRUE !(init__r321 == 0) [L160] init__tmp___4 = 1 [L162] init__r322 = (_Bool)init__tmp___4 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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, st1=0, st2=0, st3=0] [L163] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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, st1=0, st2=0, st3=0] [L165] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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, st1=0, st2=0, st3=0] [L167] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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, st1=0, st2=0, st3=0] [L169] COND TRUE ((int)id1) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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, st1=0, st2=0, st3=0] [L171] COND TRUE ((int)id2) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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, st1=0, st2=0, st3=0] [L173] COND TRUE ((int)id3) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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, st1=0, st2=0, st3=0] [L175] COND TRUE ((int)r1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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, st1=0, st2=0, st3=0] [L177] COND TRUE ((int)r2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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, st1=0, st2=0, st3=0] [L179] COND TRUE ((int)r3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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] [L181] COND TRUE !(init__r122 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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] [L183] COND TRUE !(init__r132 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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] [L185] COND TRUE !(init__r212 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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] [L187] COND TRUE !(init__r232 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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] [L189] COND TRUE !(init__r312 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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] [L191] COND TRUE !(init__r322 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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] [L193] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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] [L195] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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] [L197] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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] [L199] COND TRUE ((int)st1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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] [L201] COND TRUE ((int)st2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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] [L203] COND TRUE ((int)st3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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] [L205] COND TRUE ((int)nl1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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] [L207] COND TRUE ((int)nl2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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] [L209] COND TRUE ((int)nl3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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] [L211] COND TRUE ((int)mode1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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] [L213] COND TRUE ((int)mode2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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] [L215] COND TRUE ((int)mode3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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] [L217] COND TRUE !(newmax1 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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] [L219] COND TRUE !(newmax2 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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] [L221] COND TRUE !(newmax3 == 0) [L223] init__tmp___5 = 1 [L224] __return_1248 = init__tmp___5 [L225] main__i2 = __return_1248 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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] [L226] COND TRUE main__i2 != 0 [L228] p12_old = nomsg [L229] p12_new = nomsg [L230] p13_old = nomsg [L231] p13_new = nomsg [L232] p21_old = nomsg [L233] p21_new = nomsg [L234] p23_old = nomsg [L235] p23_new = nomsg [L236] p31_old = nomsg [L237] p31_new = nomsg [L238] p32_old = nomsg [L239] p32_new = nomsg [L240] main__i2 = 0 [L242] _Bool node1__newmax; [L243] node1__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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] [L244] COND FALSE !(!(mode1 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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] [L250] COND TRUE ((int)r1) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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] [L252] COND FALSE !(!(ep12 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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] [L265] COND TRUE !(ep13 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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] [L267] COND TRUE !(newmax1 == 0) [L269] int node1____CPAchecker_TMP_1; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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] [L270] COND TRUE max1 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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] [L272] COND TRUE p13_new == nomsg [L274] node1____CPAchecker_TMP_1 = max1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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] [L276] p13_new = node1____CPAchecker_TMP_1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, 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=127, 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] [L278] mode1 = 1 [L280] _Bool node2__newmax; [L281] node2__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, mode1=1, 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=127, 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] [L282] COND FALSE !(!(mode2 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, mode1=1, 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=127, 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] [L288] COND TRUE ((int)r2) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, mode1=1, 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=127, 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] [L290] COND TRUE !(ep21 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, mode1=1, 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=127, 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] [L292] COND TRUE !(newmax2 == 0) [L294] int node2____CPAchecker_TMP_0; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, mode1=1, 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=127, 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] [L295] COND TRUE max2 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, mode1=1, 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=127, 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] [L297] COND TRUE p21_new == nomsg [L299] node2____CPAchecker_TMP_0 = max2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, mode1=1, 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=127, 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] [L301] p21_new = node2____CPAchecker_TMP_0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, mode1=1, 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=127, p13_old=-1, p21=0, p21_new=35, 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] [L303] COND FALSE !(!(ep23 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, mode1=1, 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=127, p13_old=-1, p21=0, p21_new=35, 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] [L316] mode2 = 1 [L318] _Bool node3__newmax; [L319] node3__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, mode1=1, mode2=1, 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=127, p13_old=-1, p21=0, p21_new=35, 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] [L320] COND FALSE !(!(mode3 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, mode1=1, mode2=1, 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=127, p13_old=-1, p21=0, p21_new=35, 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] [L326] COND TRUE ((int)r3) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, mode1=1, mode2=1, 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=127, p13_old=-1, p21=0, p21_new=35, 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] [L328] COND FALSE !(!(ep31 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, mode1=1, mode2=1, 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=127, p13_old=-1, p21=0, p21_new=35, 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] [L341] COND TRUE !(ep32 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, mode1=1, mode2=1, 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=127, p13_old=-1, p21=0, p21_new=35, 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] [L343] COND TRUE !(newmax3 == 0) [L345] int node3____CPAchecker_TMP_1; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, mode1=1, mode2=1, 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=127, p13_old=-1, p21=0, p21_new=35, 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] [L346] COND TRUE max3 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, mode1=1, mode2=1, 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=127, p13_old=-1, p21=0, p21_new=35, 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] [L348] COND TRUE p32_new == nomsg [L350] node3____CPAchecker_TMP_1 = max3 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, mode1=1, mode2=1, 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=127, p13_old=-1, p21=0, p21_new=35, 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] [L352] p32_new = node3____CPAchecker_TMP_1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, mode1=1, mode2=1, 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=127, p13_old=-1, p21=0, p21_new=35, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=34, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L354] mode3 = 1 [L355] p12_old = p12_new [L356] p12_new = nomsg [L357] p13_old = p13_new [L358] p13_new = nomsg [L359] p21_old = p21_new [L360] p21_new = nomsg [L361] p23_old = p23_new [L362] p23_new = nomsg [L363] p31_old = p31_new [L364] p31_new = nomsg [L365] p32_old = p32_new [L366] p32_new = nomsg [L368] int check__tmp; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=35, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=34, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L369] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=35, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=34, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L371] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=35, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=34, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L373] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=35, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=34, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L375] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=35, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=34, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L377] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=35, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=34, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L383] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=35, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=34, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L385] COND TRUE ((int)r1) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=35, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=34, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L387] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=35, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=34, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L393] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=35, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=34, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L395] COND TRUE ((int)r1) < 2 [L397] check__tmp = 1 [L398] __return_1394 = check__tmp [L399] main__c1 = __return_1394 [L401] _Bool __tmp_1; [L402] __tmp_1 = main__c1 [L403] _Bool assert__arg; [L404] assert__arg = __tmp_1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=35, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=34, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L405] COND FALSE !(assert__arg == 0) [L412] _Bool node1__newmax; [L413] node1__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=35, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=34, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L414] COND TRUE !(mode1 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=-128, m2=0, m3=-128, max1=127, max2=35, max3=34, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=35, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=34, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L416] COND FALSE !(r1 == 255) [L422] r1 = r1 + 1 [L423] COND TRUE !(ep21 == 0) [L425] m1 = p21_old [L426] p21_old = nomsg [L427] COND FALSE !(((int)m1) > ((int)max1)) [L432] COND FALSE !(!(ep31 == 0)) [L441] newmax1 = node1__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=35, m2=0, m3=-128, max1=127, max2=35, max3=34, 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=-1, p13=0, p13_new=-1, p13_old=127, 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=34, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L442] COND TRUE ((int)r1) == 1 [L444] COND TRUE ((int)max1) == ((int)id1) [L446] st1 = 1 [L448] mode1 = 0 [L450] _Bool node2__newmax; [L451] node2__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=35, m2=0, m3=-128, max1=127, max2=35, max3=34, 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=127, 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=34, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L452] COND TRUE !(mode2 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=35, m2=0, m3=-128, max1=127, max2=35, max3=34, 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=127, 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=34, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L454] COND FALSE !(r2 == 255) [L460] r2 = r2 + 1 [L461] COND FALSE !(!(ep12 == 0)) [L470] COND TRUE !(ep32 == 0) [L472] m2 = p32_old [L473] p32_old = nomsg [L474] COND FALSE !(((int)m2) > ((int)max2)) [L479] newmax2 = node2__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=35, m2=34, m3=-128, max1=127, max2=35, max3=34, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=0, 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=127, 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=0, st1=1, st2=0, st3=0] [L480] COND FALSE !(((int)r2) == 2) [L486] mode2 = 0 [L488] _Bool node3__newmax; [L489] node3__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=35, m2=34, m3=-128, max1=127, max2=35, max3=34, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, 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=127, 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=0, st1=1, st2=0, st3=0] [L490] COND TRUE !(mode3 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=35, m2=34, m3=-128, max1=127, max2=35, max3=34, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, 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=127, 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=0, st1=1, st2=0, st3=0] [L492] COND FALSE !(r3 == 255) [L498] r3 = r3 + 1 [L499] COND TRUE !(ep13 == 0) [L501] m3 = p13_old [L502] p13_old = nomsg [L503] COND TRUE ((int)m3) > ((int)max3) [L505] max3 = m3 [L506] node3__newmax = 1 [L508] COND FALSE !(!(ep23 == 0)) [L517] newmax3 = node3__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=35, m2=34, m3=127, max1=127, max2=35, max3=127, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L518] COND FALSE !(((int)r3) == 2) [L524] mode3 = 0 [L525] p12_old = p12_new [L526] p12_new = nomsg [L527] p13_old = p13_new [L528] p13_new = nomsg [L529] p21_old = p21_new [L530] p21_new = nomsg [L531] p23_old = p23_new [L532] p23_new = nomsg [L533] p31_old = p31_new [L534] p31_new = nomsg [L535] p32_old = p32_new [L536] p32_new = nomsg [L538] int check__tmp; VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=35, m2=34, m3=127, max1=127, max2=35, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L539] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=35, m2=34, m3=127, max1=127, max2=35, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L541] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=35, m2=34, m3=127, max1=127, max2=35, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L543] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=35, m2=34, m3=127, max1=127, max2=35, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L545] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=35, m2=34, m3=127, max1=127, max2=35, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L547] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=35, m2=34, m3=127, max1=127, max2=35, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L553] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 0) [L1192] check__tmp = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=35, m2=34, m3=127, max1=127, max2=35, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L571] __return_1528 = check__tmp [L572] main__c1 = __return_1528 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=35, m2=34, m3=127, max1=127, max2=35, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L575] _Bool __tmp_2; [L576] __tmp_2 = main__c1 [L577] _Bool assert__arg; [L578] assert__arg = __tmp_2 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=35, m2=34, m3=127, max1=127, max2=35, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L579] COND TRUE assert__arg == 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=35, m2=34, m3=127, max1=127, max2=35, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L581] __VERIFIER_error() VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=35, id3=34, m1=35, m2=34, m3=127, max1=127, max2=35, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 322.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -164.9 MB). Peak memory consumption was 33.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.02 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. * Boogie Preprocessor took 22.84 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 986.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 879.4 MB in the end (delta: 226.9 MB). Peak memory consumption was 226.9 MB. Max. memory is 11.5 GB. * CodeCheck took 497786.18 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24.1 MB). Free memory was 879.4 MB in the beginning and 780.4 MB in the end (delta: 99.0 MB). Peak memory consumption was 123.1 MB. Max. memory is 11.5 GB. * Witness Printer took 90.59 ms. Allocated memory is still 1.2 GB. Free memory was 780.4 MB in the beginning and 742.7 MB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...