./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.4.ufo.UNBOUNDED.pals.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_fa5a4224-4b77-49b0-8396-ba8c29f9a4a3/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fa5a4224-4b77-49b0-8396-ba8c29f9a4a3/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fa5a4224-4b77-49b0-8396-ba8c29f9a4a3/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fa5a4224-4b77-49b0-8396-ba8c29f9a4a3/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.4.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/working_dir_fa5a4224-4b77-49b0-8396-ba8c29f9a4a3/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fa5a4224-4b77-49b0-8396-ba8c29f9a4a3/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 6d9066a9c9a0f98758515c22da9fb874b191c54e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-08 17:21:53,980 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 17:21:53,981 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 17:21:53,987 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 17:21:53,987 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 17:21:53,987 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 17:21:53,988 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 17:21:53,988 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 17:21:53,989 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 17:21:53,990 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 17:21:53,990 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 17:21:53,990 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 17:21:53,991 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 17:21:53,991 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 17:21:53,992 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 17:21:53,992 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 17:21:53,992 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 17:21:53,993 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 17:21:53,994 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 17:21:53,995 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 17:21:53,995 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 17:21:53,996 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 17:21:53,997 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 17:21:53,997 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 17:21:53,997 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 17:21:53,997 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 17:21:53,998 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 17:21:53,998 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 17:21:53,998 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 17:21:53,999 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 17:21:53,999 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 17:21:53,999 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 17:21:53,999 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 17:21:54,000 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 17:21:54,000 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 17:21:54,000 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 17:21:54,000 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fa5a4224-4b77-49b0-8396-ba8c29f9a4a3/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-08 17:21:54,007 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 17:21:54,008 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 17:21:54,008 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 17:21:54,008 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-08 17:21:54,008 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 17:21:54,009 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 17:21:54,009 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 17:21:54,009 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 17:21:54,009 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 17:21:54,009 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 17:21:54,009 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 17:21:54,009 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 17:21:54,009 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 17:21:54,009 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 17:21:54,009 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 17:21:54,009 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 17:21:54,010 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 17:21:54,010 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 17:21:54,010 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-08 17:21:54,010 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-08 17:21:54,010 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 17:21:54,010 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 17:21:54,010 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-08 17:21:54,010 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 17:21:54,010 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 17:21:54,010 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 17:21:54,011 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-08 17:21:54,011 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 17:21:54,011 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 17:21:54,011 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_fa5a4224-4b77-49b0-8396-ba8c29f9a4a3/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 -> 6d9066a9c9a0f98758515c22da9fb874b191c54e [2018-12-08 17:21:54,028 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 17:21:54,035 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 17:21:54,038 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 17:21:54,039 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 17:21:54,039 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 17:21:54,039 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fa5a4224-4b77-49b0-8396-ba8c29f9a4a3/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.4.ufo.UNBOUNDED.pals.c [2018-12-08 17:21:54,072 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fa5a4224-4b77-49b0-8396-ba8c29f9a4a3/bin-2019/ukojak/data/72c06dbac/abc3bef83d1045cebe4a3d2e380a2ef1/FLAG874a90304 [2018-12-08 17:21:54,511 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 17:21:54,511 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fa5a4224-4b77-49b0-8396-ba8c29f9a4a3/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.4.ufo.UNBOUNDED.pals.c [2018-12-08 17:21:54,517 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fa5a4224-4b77-49b0-8396-ba8c29f9a4a3/bin-2019/ukojak/data/72c06dbac/abc3bef83d1045cebe4a3d2e380a2ef1/FLAG874a90304 [2018-12-08 17:21:54,525 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fa5a4224-4b77-49b0-8396-ba8c29f9a4a3/bin-2019/ukojak/data/72c06dbac/abc3bef83d1045cebe4a3d2e380a2ef1 [2018-12-08 17:21:54,527 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 17:21:54,528 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 17:21:54,528 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 17:21:54,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 17:21:54,530 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 17:21:54,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:21:54" (1/1) ... [2018-12-08 17:21:54,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@354f5439 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:21:54, skipping insertion in model container [2018-12-08 17:21:54,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:21:54" (1/1) ... [2018-12-08 17:21:54,536 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 17:21:54,555 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 17:21:54,678 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:21:54,684 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 17:21:54,750 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:21:54,761 INFO L195 MainTranslator]: Completed translation [2018-12-08 17:21:54,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:21:54 WrapperNode [2018-12-08 17:21:54,761 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 17:21:54,762 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 17:21:54,762 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 17:21:54,762 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 17:21:54,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:21:54" (1/1) ... [2018-12-08 17:21:54,774 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:21:54" (1/1) ... [2018-12-08 17:21:54,793 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 17:21:54,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 17:21:54,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 17:21:54,793 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 17:21:54,799 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:21:54" (1/1) ... [2018-12-08 17:21:54,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:21:54" (1/1) ... [2018-12-08 17:21:54,801 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:21:54" (1/1) ... [2018-12-08 17:21:54,801 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:21:54" (1/1) ... [2018-12-08 17:21:54,805 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:21:54" (1/1) ... [2018-12-08 17:21:54,811 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:21:54" (1/1) ... [2018-12-08 17:21:54,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:21:54" (1/1) ... [2018-12-08 17:21:54,814 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 17:21:54,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 17:21:54,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 17:21:54,815 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 17:21:54,815 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:21:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa5a4224-4b77-49b0-8396-ba8c29f9a4a3/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-08 17:21:54,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 17:21:54,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 17:21:56,262 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 17:21:56,262 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-08 17:21:56,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:21:56 BoogieIcfgContainer [2018-12-08 17:21:56,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 17:21:56,263 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-08 17:21:56,263 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-08 17:21:56,269 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-08 17:21:56,270 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:21:56" (1/1) ... [2018-12-08 17:21:56,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:21:56,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:21:56,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 18 states and 29 transitions. [2018-12-08 17:21:56,298 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. [2018-12-08 17:21:56,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-08 17:21:56,299 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:21:56,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:21:56,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-08 17:21:56,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:21:56,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 19 states and 31 transitions. [2018-12-08 17:21:56,656 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2018-12-08 17:21:56,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-08 17:21:56,657 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:21:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:21:56,774 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-08 17:21:56,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:21:56,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 22 states and 37 transitions. [2018-12-08 17:21:56,949 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 37 transitions. [2018-12-08 17:21:56,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-08 17:21:56,951 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:21:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:21:57,064 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-08 17:21:57,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:21:57,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 26 states and 45 transitions. [2018-12-08 17:21:57,322 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2018-12-08 17:21:57,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-08 17:21:57,322 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:21:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:21:57,478 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-08 17:21:57,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:21:57,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 31 states and 55 transitions. [2018-12-08 17:21:57,869 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 55 transitions. [2018-12-08 17:21:57,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-08 17:21:57,869 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:21:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:21:58,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-08 17:21:58,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:21:58,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 38 states and 67 transitions. [2018-12-08 17:21:58,605 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 67 transitions. [2018-12-08 17:21:58,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-08 17:21:58,605 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:21:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:21:58,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-08 17:21:59,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:21:59,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 44 states and 78 transitions. [2018-12-08 17:21:59,520 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 78 transitions. [2018-12-08 17:21:59,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 17:21:59,521 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:21:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:21:59,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:21:59,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:21:59,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 45 states and 78 transitions. [2018-12-08 17:21:59,727 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 78 transitions. [2018-12-08 17:21:59,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 17:21:59,727 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:21:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:21:59,747 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-08 17:21:59,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:21:59,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2018-12-08 17:21:59,756 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2018-12-08 17:21:59,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 17:21:59,757 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:21:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:21:59,903 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-08 17:22:01,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:22:01,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 56 states and 95 transitions. [2018-12-08 17:22:01,409 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 95 transitions. [2018-12-08 17:22:01,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-08 17:22:01,410 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:22:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:22:01,534 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-08 17:22:01,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:22:01,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 59 states and 107 transitions. [2018-12-08 17:22:01,714 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 107 transitions. [2018-12-08 17:22:01,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-08 17:22:01,715 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:22:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:22:02,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:22:05,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:22:05,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 74 states and 135 transitions. [2018-12-08 17:22:05,834 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 135 transitions. [2018-12-08 17:22:05,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-08 17:22:05,834 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:22:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:22:06,247 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:22:10,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:22:10,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 90 states and 164 transitions. [2018-12-08 17:22:10,850 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 164 transitions. [2018-12-08 17:22:10,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-08 17:22:10,851 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:22:10,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:22:11,228 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:22:14,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:22:14,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 95 states and 177 transitions. [2018-12-08 17:22:14,940 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 177 transitions. [2018-12-08 17:22:14,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-08 17:22:14,940 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:22:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:22:15,034 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:22:15,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:22:15,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 97 states and 181 transitions. [2018-12-08 17:22:15,458 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 181 transitions. [2018-12-08 17:22:15,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 17:22:15,458 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:22:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:22:16,050 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:22:20,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:22:20,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 112 states and 209 transitions. [2018-12-08 17:22:20,566 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 209 transitions. [2018-12-08 17:22:20,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 17:22:20,567 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:22:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:22:20,651 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:22:21,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:22:21,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 115 states and 217 transitions. [2018-12-08 17:22:21,450 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 217 transitions. [2018-12-08 17:22:21,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-08 17:22:21,450 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:22:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:22:22,395 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:22:26,614 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2018-12-08 17:22:27,671 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2018-12-08 17:22:28,528 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2018-12-08 17:22:30,509 WARN L180 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2018-12-08 17:22:34,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:22:34,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 132 states and 249 transitions. [2018-12-08 17:22:34,027 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 249 transitions. [2018-12-08 17:22:34,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-08 17:22:34,027 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:22:34,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:22:34,163 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:22:35,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:22:35,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 135 states and 259 transitions. [2018-12-08 17:22:35,617 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 259 transitions. [2018-12-08 17:22:35,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 17:22:35,618 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:22:35,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:22:36,118 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:22:38,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:22:38,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 140 states and 268 transitions. [2018-12-08 17:22:38,332 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 268 transitions. [2018-12-08 17:22:38,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 17:22:38,333 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:22:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:22:38,530 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:22:39,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:22:39,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 143 states and 273 transitions. [2018-12-08 17:22:39,992 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 273 transitions. [2018-12-08 17:22:39,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 17:22:39,993 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:22:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:22:40,203 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:22:40,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:22:40,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 144 states and 275 transitions. [2018-12-08 17:22:40,575 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 275 transitions. [2018-12-08 17:22:40,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 17:22:40,575 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:22:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:22:41,556 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:22:42,467 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2018-12-08 17:22:45,334 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2018-12-08 17:22:48,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:22:48,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 151 states and 295 transitions. [2018-12-08 17:22:48,998 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 295 transitions. [2018-12-08 17:22:48,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 17:22:48,998 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:22:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:22:49,470 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:22:50,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:22:50,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 154 states and 303 transitions. [2018-12-08 17:22:50,417 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 303 transitions. [2018-12-08 17:22:50,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 17:22:50,417 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:22:50,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:22:50,913 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:22:51,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:22:51,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 155 states and 308 transitions. [2018-12-08 17:22:51,420 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 308 transitions. [2018-12-08 17:22:51,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-08 17:22:51,421 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:22:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:22:52,665 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:23:04,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:23:04,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 180 states and 379 transitions. [2018-12-08 17:23:04,479 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 379 transitions. [2018-12-08 17:23:04,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-08 17:23:04,479 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:23:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:23:04,628 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:23:07,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:23:07,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 185 states and 389 transitions. [2018-12-08 17:23:07,670 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 389 transitions. [2018-12-08 17:23:07,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-08 17:23:07,671 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:23:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:23:07,849 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:23:11,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:23:11,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 188 states and 397 transitions. [2018-12-08 17:23:11,749 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 397 transitions. [2018-12-08 17:23:11,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 17:23:11,751 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:23:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:23:15,182 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:23:21,432 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2018-12-08 17:23:23,452 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2018-12-08 17:23:23,871 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2018-12-08 17:23:28,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:23:28,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 202 states and 433 transitions. [2018-12-08 17:23:28,302 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 433 transitions. [2018-12-08 17:23:28,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 17:23:28,303 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:23:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:23:28,894 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:23:31,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:23:31,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 208 states and 454 transitions. [2018-12-08 17:23:31,927 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 454 transitions. [2018-12-08 17:23:31,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 17:23:31,928 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:23:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:23:32,459 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:23:34,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:23:34,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 211 states and 459 transitions. [2018-12-08 17:23:34,410 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 459 transitions. [2018-12-08 17:23:34,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-08 17:23:34,410 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:23:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:23:37,491 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:23:46,302 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2018-12-08 17:23:46,753 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2018-12-08 17:23:51,687 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2018-12-08 17:23:53,073 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2018-12-08 17:24:01,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:24:01,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 239 states and 531 transitions. [2018-12-08 17:24:01,020 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 531 transitions. [2018-12-08 17:24:01,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-08 17:24:01,021 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:24:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:24:01,451 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:24:05,955 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2018-12-08 17:24:06,373 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2018-12-08 17:24:09,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:24:09,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 245 states and 546 transitions. [2018-12-08 17:24:09,617 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 546 transitions. [2018-12-08 17:24:09,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-08 17:24:09,618 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:24:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:24:10,037 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:24:10,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:24:10,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 246 states and 554 transitions. [2018-12-08 17:24:10,747 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 554 transitions. [2018-12-08 17:24:10,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-08 17:24:10,748 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:24:10,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:24:13,736 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:24:31,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:24:31,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 271 states and 606 transitions. [2018-12-08 17:24:31,722 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 606 transitions. [2018-12-08 17:24:31,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-08 17:24:31,722 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:24:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:24:31,835 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:24:34,462 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2018-12-08 17:24:34,894 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2018-12-08 17:24:39,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:24:39,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 278 states and 632 transitions. [2018-12-08 17:24:39,021 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 632 transitions. [2018-12-08 17:24:39,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-08 17:24:39,021 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:24:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:24:39,135 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:24:40,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:24:40,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 279 states and 640 transitions. [2018-12-08 17:24:40,012 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 640 transitions. [2018-12-08 17:24:40,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-08 17:24:40,012 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:24:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:24:40,134 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:24:41,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:24:41,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 280 states and 643 transitions. [2018-12-08 17:24:41,133 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 643 transitions. [2018-12-08 17:24:41,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-08 17:24:41,134 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:24:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:24:44,796 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:24:51,605 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2018-12-08 17:24:54,725 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2018-12-08 17:24:55,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:24:55,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 283 states and 656 transitions. [2018-12-08 17:24:55,991 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 656 transitions. [2018-12-08 17:24:55,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-08 17:24:55,992 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:24:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:24:56,272 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:24:57,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:24:57,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 284 states and 658 transitions. [2018-12-08 17:24:57,499 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 658 transitions. [2018-12-08 17:24:57,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-08 17:24:57,500 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:24:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:24:57,792 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:24:58,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:24:58,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 285 states and 665 transitions. [2018-12-08 17:24:58,812 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 665 transitions. [2018-12-08 17:24:58,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-08 17:24:58,812 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:24:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:24:59,107 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:25:03,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:25:03,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 288 states and 679 transitions. [2018-12-08 17:25:03,325 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 679 transitions. [2018-12-08 17:25:03,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-08 17:25:03,325 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:25:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:08,076 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:25:15,602 WARN L180 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2018-12-08 17:25:25,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:25:25,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 300 states and 707 transitions. [2018-12-08 17:25:25,318 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 707 transitions. [2018-12-08 17:25:25,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-08 17:25:25,318 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:25:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:25,720 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:25:26,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:25:26,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 301 states and 711 transitions. [2018-12-08 17:25:26,708 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 711 transitions. [2018-12-08 17:25:26,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-08 17:25:26,709 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:25:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:27,097 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:25:28,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:25:28,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 302 states and 717 transitions. [2018-12-08 17:25:28,102 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 717 transitions. [2018-12-08 17:25:28,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-08 17:25:28,103 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:25:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:28,504 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:25:31,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:25:31,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 305 states and 744 transitions. [2018-12-08 17:25:31,643 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 744 transitions. [2018-12-08 17:25:31,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 17:25:31,643 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:25:31,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:33,950 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:25:42,662 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2018-12-08 17:25:44,442 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 34 [2018-12-08 17:25:44,816 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2018-12-08 17:25:46,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:25:46,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 309 states and 764 transitions. [2018-12-08 17:25:46,816 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 764 transitions. [2018-12-08 17:25:46,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 17:25:46,817 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:25:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:47,030 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:25:49,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:25:49,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 310 states and 767 transitions. [2018-12-08 17:25:49,530 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 767 transitions. [2018-12-08 17:25:49,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 17:25:49,531 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:25:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:49,740 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:25:51,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:25:51,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 311 states and 772 transitions. [2018-12-08 17:25:51,101 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 772 transitions. [2018-12-08 17:25:51,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 17:25:51,101 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:25:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:51,295 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:25:52,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:25:52,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 312 states and 774 transitions. [2018-12-08 17:25:52,324 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 774 transitions. [2018-12-08 17:25:52,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-08 17:25:52,325 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:25:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:25:52,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:25:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:25:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:25:54,365 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 50 iterations. [2018-12-08 17:25:54,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.12 05:25:54 ImpRootNode [2018-12-08 17:25:54,441 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-08 17:25:54,441 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 17:25:54,441 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 17:25:54,441 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 17:25:54,442 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:21:56" (3/4) ... [2018-12-08 17:25:54,443 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 17:25:54,522 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fa5a4224-4b77-49b0-8396-ba8c29f9a4a3/bin-2019/ukojak/witness.graphml [2018-12-08 17:25:54,522 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 17:25:54,523 INFO L168 Benchmark]: Toolchain (without parser) took 239995.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 954.4 MB in the beginning and 846.0 MB in the end (delta: 108.4 MB). Peak memory consumption was 250.5 MB. Max. memory is 11.5 GB. [2018-12-08 17:25:54,523 INFO L168 Benchmark]: CDTParser took 0.10 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-08 17:25:54,523 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -169.1 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2018-12-08 17:25:54,523 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.77 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-08 17:25:54,523 INFO L168 Benchmark]: Boogie Preprocessor took 21.60 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-08 17:25:54,524 INFO L168 Benchmark]: RCFGBuilder took 1448.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 978.2 MB in the end (delta: 137.2 MB). Peak memory consumption was 261.4 MB. Max. memory is 11.5 GB. [2018-12-08 17:25:54,524 INFO L168 Benchmark]: CodeCheck took 238177.79 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 16.3 MB). Free memory was 978.2 MB in the beginning and 870.0 MB in the end (delta: 108.2 MB). Peak memory consumption was 124.5 MB. Max. memory is 11.5 GB. [2018-12-08 17:25:54,524 INFO L168 Benchmark]: Witness Printer took 81.14 ms. Allocated memory is still 1.2 GB. Free memory was 870.0 MB in the beginning and 846.0 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2018-12-08 17:25:54,525 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, 146 locations, 1 error locations. UNSAFE Result, 238.0s OverallTime, 50 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 0 SDtfs, 1051876476 SDslu, 0 SDs, 0 SdLazy, -848142348 SolverSat, -784512872 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 113.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15861 GetRequests, 13850 SyntacticMatches, 853 SemanticMatches, 1158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861889 ImplicationChecksByTransitivity, 224.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 4.0s SatisfiabilityAnalysisTime, 30.6s InterpolantComputationTime, 1380 NumberOfCodeBlocks, 1380 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 1286 ConstructedInterpolants, 0 QuantifiedInterpolants, 663182 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 49 InterpolantComputations, 10 PerfectInterpolantSequences, 151/827 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: 652]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L70] msg_t nomsg = (msg_t )-1; [L71] port_t p12 ; [L72] char p12_old ; [L73] char p12_new ; [L74] _Bool ep12 ; [L75] port_t p13 ; [L76] char p13_old ; [L77] char p13_new ; [L78] _Bool ep13 ; [L79] port_t p21 ; [L80] char p21_old ; [L81] char p21_new ; [L82] _Bool ep21 ; [L83] port_t p23 ; [L84] char p23_old ; [L85] char p23_new ; [L86] _Bool ep23 ; [L87] port_t p31 ; [L88] char p31_old ; [L89] char p31_new ; [L90] _Bool ep31 ; [L91] port_t p32 ; [L92] char p32_old ; [L93] char p32_new ; [L94] _Bool ep32 ; [L95] char id1 ; [L96] unsigned char r1 ; [L97] char st1 ; [L98] char nl1 ; [L99] char m1 ; [L100] char max1 ; [L101] _Bool mode1 ; [L102] _Bool newmax1 ; [L103] char id2 ; [L104] unsigned char r2 ; [L105] char st2 ; [L106] char nl2 ; [L107] char m2 ; [L108] char max2 ; [L109] _Bool mode2 ; [L110] _Bool newmax2 ; [L111] char id3 ; [L112] unsigned char r3 ; [L113] char st3 ; [L114] char nl3 ; [L115] char m3 ; [L116] char max3 ; [L117] _Bool mode3 ; [L118] _Bool newmax3 ; [L281] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L571] int c1 ; [L572] int i2 ; [L575] c1 = 0 [L576] ep12 = __VERIFIER_nondet_bool() [L577] ep13 = __VERIFIER_nondet_bool() [L578] ep21 = __VERIFIER_nondet_bool() [L579] ep23 = __VERIFIER_nondet_bool() [L580] ep31 = __VERIFIER_nondet_bool() [L581] ep32 = __VERIFIER_nondet_bool() [L582] id1 = __VERIFIER_nondet_char() [L583] r1 = __VERIFIER_nondet_uchar() [L584] st1 = __VERIFIER_nondet_char() [L585] nl1 = __VERIFIER_nondet_char() [L586] m1 = __VERIFIER_nondet_char() [L587] max1 = __VERIFIER_nondet_char() [L588] mode1 = __VERIFIER_nondet_bool() [L589] newmax1 = __VERIFIER_nondet_bool() [L590] id2 = __VERIFIER_nondet_char() [L591] r2 = __VERIFIER_nondet_uchar() [L592] st2 = __VERIFIER_nondet_char() [L593] nl2 = __VERIFIER_nondet_char() [L594] m2 = __VERIFIER_nondet_char() [L595] max2 = __VERIFIER_nondet_char() [L596] mode2 = __VERIFIER_nondet_bool() [L597] newmax2 = __VERIFIER_nondet_bool() [L598] id3 = __VERIFIER_nondet_char() [L599] r3 = __VERIFIER_nondet_uchar() [L600] st3 = __VERIFIER_nondet_char() [L601] nl3 = __VERIFIER_nondet_char() [L602] m3 = __VERIFIER_nondet_char() [L603] max3 = __VERIFIER_nondet_char() [L604] mode3 = __VERIFIER_nondet_bool() [L605] newmax3 = __VERIFIER_nondet_bool() [L284] _Bool r121 ; [L285] _Bool r131 ; [L286] _Bool r211 ; [L287] _Bool r231 ; [L288] _Bool r311 ; [L289] _Bool r321 ; [L290] _Bool r122 ; [L291] int tmp ; [L292] _Bool r132 ; [L293] int tmp___0 ; [L294] _Bool r212 ; [L295] int tmp___1 ; [L296] _Bool r232 ; [L297] int tmp___2 ; [L298] _Bool r312 ; [L299] int tmp___3 ; [L300] _Bool r322 ; [L301] int tmp___4 ; [L302] int tmp___5 ; [L305] r121 = ep12 [L306] r131 = ep13 [L307] r211 = ep21 [L308] r231 = ep23 [L309] r311 = ep31 [L310] r321 = ep32 [L311] COND FALSE !(\read(r121)) [L314] COND TRUE \read(r131) [L315] COND TRUE \read(ep32) [L316] tmp = 1 [L323] r122 = (_Bool )tmp [L324] COND TRUE \read(r131) [L325] tmp___0 = 1 [L336] r132 = (_Bool )tmp___0 [L337] COND TRUE \read(r211) [L338] tmp___1 = 1 [L349] r212 = (_Bool )tmp___1 [L350] COND FALSE !(\read(r231)) [L353] COND TRUE \read(r211) [L354] COND TRUE \read(ep13) [L355] tmp___2 = 1 [L362] r232 = (_Bool )tmp___2 [L363] COND TRUE \read(r311) [L364] tmp___3 = 1 [L375] r312 = (_Bool )tmp___3 [L376] COND TRUE \read(r321) [L377] tmp___4 = 1 [L388] r322 = (_Bool )tmp___4 [L389] COND TRUE (int )id1 != (int )id2 [L390] COND TRUE (int )id1 != (int )id3 [L391] COND TRUE (int )id2 != (int )id3 [L392] COND TRUE (int )id1 >= 0 [L393] COND TRUE (int )id2 >= 0 [L394] COND TRUE (int )id3 >= 0 [L395] COND TRUE (int )r1 == 0 [L396] COND TRUE (int )r2 == 0 [L397] COND TRUE (int )r3 == 0 [L398] COND TRUE \read(r122) [L399] COND TRUE \read(r132) [L400] COND TRUE \read(r212) [L401] COND TRUE \read(r232) [L402] COND TRUE \read(r312) [L403] COND TRUE \read(r322) [L404] COND TRUE (int )max1 == (int )id1 [L405] COND TRUE (int )max2 == (int )id2 [L406] COND TRUE (int )max3 == (int )id3 [L407] COND TRUE (int )st1 == 0 [L408] COND TRUE (int )st2 == 0 [L409] COND TRUE (int )st3 == 0 [L410] COND TRUE (int )nl1 == 0 [L411] COND TRUE (int )nl2 == 0 [L412] COND TRUE (int )nl3 == 0 [L413] COND TRUE (int )mode1 == 0 [L414] COND TRUE (int )mode2 == 0 [L415] COND TRUE (int )mode3 == 0 [L416] COND TRUE \read(newmax1) [L417] COND TRUE \read(newmax2) [L418] COND TRUE \read(newmax3) [L419] tmp___5 = 1 [L510] return (tmp___5); [L606] i2 = init() [L608] p12_old = nomsg [L609] p12_new = nomsg [L610] p13_old = nomsg [L611] p13_new = nomsg [L612] p21_old = nomsg [L613] p21_new = nomsg [L614] p23_old = nomsg [L615] p23_new = nomsg [L616] p31_old = nomsg [L617] p31_new = nomsg [L618] p32_old = nomsg [L619] p32_new = nomsg [L620] i2 = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=4, m2=127, m3=-2, max1=3, max2=127, max3=5, 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] [L621] COND TRUE 1 [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND FALSE !(\read(mode1)) [L156] COND TRUE (int )r1 < 1 [L157] COND FALSE !(\read(ep12)) [L162] COND TRUE \read(ep13) [L163] COND TRUE \read(newmax1) [L164] EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L164] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L168] mode1 = (_Bool)1 [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND FALSE !(\read(mode2)) [L210] COND TRUE (int )r2 < 2 [L211] COND TRUE \read(ep21) [L212] COND TRUE \read(newmax2) [L213] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L213] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L216] COND FALSE !(\read(ep23)) [L222] mode2 = (_Bool)1 [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND FALSE !(\read(mode3)) [L264] COND TRUE (int )r3 < 2 [L265] COND TRUE \read(ep31) [L266] COND TRUE \read(newmax3) [L267] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L267] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L270] COND TRUE \read(ep32) [L271] COND TRUE \read(newmax3) [L272] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L272] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L276] mode3 = (_Bool)1 [L626] p12_old = p12_new [L627] p12_new = nomsg [L628] p13_old = p13_new [L629] p13_new = nomsg [L630] p21_old = p21_new [L631] p21_new = nomsg [L632] p23_old = p23_new [L633] p23_new = nomsg [L634] p31_old = p31_new [L635] p31_new = nomsg [L636] p32_old = p32_new [L637] p32_new = nomsg [L515] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=4, m2=127, m3=-2, max1=3, max2=127, max3=5, 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=3, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L518] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=4, m2=127, m3=-2, max1=3, max2=127, max3=5, 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=3, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L519] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=4, m2=127, m3=-2, max1=3, max2=127, max3=5, 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=3, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L520] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=4, m2=127, m3=-2, max1=3, max2=127, max3=5, 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=3, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L521] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=4, m2=127, m3=-2, max1=3, max2=127, max3=5, 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=3, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=4, m2=127, m3=-2, max1=3, max2=127, max3=5, 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=3, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L525] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=4, m2=127, m3=-2, max1=3, max2=127, max3=5, 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=3, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L527] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=4, m2=127, m3=-2, max1=3, max2=127, max3=5, 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=3, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L532] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=4, m2=127, m3=-2, max1=3, max2=127, max3=5, 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=3, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L535] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=4, m2=127, m3=-2, max1=3, max2=127, max3=5, 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=3, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L537] COND TRUE (int )r1 < 2 [L538] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=4, m2=127, m3=-2, max1=3, max2=127, max3=5, 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=3, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L566] return (tmp); [L638] c1 = check() [L650] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=4, m2=127, m3=-2, max1=3, max2=127, max3=5, 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=3, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L621] COND TRUE 1 [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND TRUE \read(mode1) [L126] COND FALSE !(r1 == 255) [L129] r1 = r1 + 1 [L130] COND TRUE \read(ep21) [L131] m1 = p21_old [L132] p21_old = nomsg [L133] COND TRUE (int )m1 > (int )max1 [L134] max1 = m1 [L135] newmax = (_Bool)1 [L138] COND TRUE \read(ep31) [L139] m1 = p31_old [L140] p31_old = nomsg [L141] COND FALSE !((int )m1 > (int )max1) [L146] newmax1 = newmax [L147] COND FALSE !((int )r1 == 2) [L154] mode1 = (_Bool)0 [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND TRUE \read(mode2) [L180] COND FALSE !(r2 == 255) [L183] r2 = r2 + 1 [L184] COND FALSE !(\read(ep12)) [L192] COND TRUE \read(ep32) [L193] m2 = p32_old [L194] p32_old = nomsg [L195] COND FALSE !((int )m2 > (int )max2) [L200] newmax2 = newmax [L201] COND FALSE !((int )r2 == 2) [L208] mode2 = (_Bool)0 [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND TRUE \read(mode3) [L234] COND FALSE !(r3 == 255) [L237] r3 = r3 + 1 [L238] COND TRUE \read(ep13) [L239] m3 = p13_old [L240] p13_old = nomsg [L241] COND FALSE !((int )m3 > (int )max3) [L246] COND FALSE !(\read(ep23)) [L254] newmax3 = newmax [L255] COND FALSE !((int )r3 == 2) [L262] mode3 = (_Bool)0 [L626] p12_old = p12_new [L627] p12_new = nomsg [L628] p13_old = p13_new [L629] p13_new = nomsg [L630] p21_old = p21_new [L631] p21_new = nomsg [L632] p23_old = p23_new [L633] p23_new = nomsg [L634] p31_old = p31_new [L635] p31_new = nomsg [L636] p32_old = p32_new [L637] p32_new = nomsg [L515] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=5, m2=5, m3=3, max1=127, max2=127, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L518] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=5, m2=5, m3=3, max1=127, max2=127, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L519] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=5, m2=5, m3=3, max1=127, max2=127, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L520] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=5, m2=5, m3=3, max1=127, max2=127, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L521] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=5, m2=5, m3=3, max1=127, max2=127, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=5, m2=5, m3=3, max1=127, max2=127, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L525] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=5, m2=5, m3=3, max1=127, max2=127, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L527] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=5, m2=5, m3=3, max1=127, max2=127, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L532] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=5, m2=5, m3=3, max1=127, max2=127, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L535] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=5, m2=5, m3=3, max1=127, max2=127, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L537] COND TRUE (int )r1 < 2 [L538] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=5, m2=5, m3=3, max1=127, max2=127, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L566] return (tmp); [L638] c1 = check() [L650] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=5, m2=5, m3=3, max1=127, max2=127, max3=5, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L621] COND TRUE 1 [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND FALSE !(\read(mode1)) [L156] COND FALSE !((int )r1 < 1) [L168] mode1 = (_Bool)1 [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND FALSE !(\read(mode2)) [L210] COND TRUE (int )r2 < 2 [L211] COND TRUE \read(ep21) [L212] COND FALSE !(\read(newmax2)) [L216] COND FALSE !(\read(ep23)) [L222] mode2 = (_Bool)1 [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND FALSE !(\read(mode3)) [L264] COND TRUE (int )r3 < 2 [L265] COND TRUE \read(ep31) [L266] COND FALSE !(\read(newmax3)) [L270] COND TRUE \read(ep32) [L271] COND FALSE !(\read(newmax3)) [L276] mode3 = (_Bool)1 [L626] p12_old = p12_new [L627] p12_new = nomsg [L628] p13_old = p13_new [L629] p13_new = nomsg [L630] p21_old = p21_new [L631] p21_new = nomsg [L632] p23_old = p23_new [L633] p23_new = nomsg [L634] p31_old = p31_new [L635] p31_new = nomsg [L636] p32_old = p32_new [L637] p32_new = nomsg [L515] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=5, m2=5, m3=3, max1=127, max2=127, max3=5, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L518] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=5, m2=5, m3=3, max1=127, max2=127, max3=5, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L519] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=5, m2=5, m3=3, max1=127, max2=127, max3=5, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L520] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=5, m2=5, m3=3, max1=127, max2=127, max3=5, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L521] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=5, m2=5, m3=3, max1=127, max2=127, max3=5, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=5, m2=5, m3=3, max1=127, max2=127, max3=5, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L525] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=5, m2=5, m3=3, max1=127, max2=127, max3=5, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L527] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=5, m2=5, m3=3, max1=127, max2=127, max3=5, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L532] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=5, m2=5, m3=3, max1=127, max2=127, max3=5, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L535] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=5, m2=5, m3=3, max1=127, max2=127, max3=5, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L537] COND TRUE (int )r1 < 2 [L538] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=5, m2=5, m3=3, max1=127, max2=127, max3=5, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L566] return (tmp); [L638] c1 = check() [L650] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=5, m2=5, m3=3, max1=127, max2=127, max3=5, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L621] COND TRUE 1 [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND TRUE \read(mode1) [L126] COND FALSE !(r1 == 255) [L129] r1 = r1 + 1 [L130] COND TRUE \read(ep21) [L131] m1 = p21_old [L132] p21_old = nomsg [L133] COND FALSE !((int )m1 > (int )max1) [L138] COND TRUE \read(ep31) [L139] m1 = p31_old [L140] p31_old = nomsg [L141] COND FALSE !((int )m1 > (int )max1) [L146] newmax1 = newmax [L147] COND TRUE (int )r1 == 2 [L148] COND FALSE !((int )max1 == (int )id1) [L151] nl1 = (char)1 [L154] mode1 = (_Bool)0 [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND TRUE \read(mode2) [L180] COND FALSE !(r2 == 255) [L183] r2 = r2 + 1 [L184] COND FALSE !(\read(ep12)) [L192] COND TRUE \read(ep32) [L193] m2 = p32_old [L194] p32_old = nomsg [L195] COND FALSE !((int )m2 > (int )max2) [L200] newmax2 = newmax [L201] COND TRUE (int )r2 == 2 [L202] COND TRUE (int )max2 == (int )id2 [L203] st2 = (char)1 [L208] mode2 = (_Bool)0 [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND TRUE \read(mode3) [L234] COND FALSE !(r3 == 255) [L237] r3 = r3 + 1 [L238] COND TRUE \read(ep13) [L239] m3 = p13_old [L240] p13_old = nomsg [L241] COND FALSE !((int )m3 > (int )max3) [L246] COND FALSE !(\read(ep23)) [L254] newmax3 = newmax [L255] COND TRUE (int )r3 == 2 [L256] COND TRUE (int )max3 == (int )id3 [L257] st3 = (char)1 [L262] mode3 = (_Bool)0 [L626] p12_old = p12_new [L627] p12_new = nomsg [L628] p13_old = p13_new [L629] p13_new = nomsg [L630] p21_old = p21_new [L631] p21_new = nomsg [L632] p23_old = p23_new [L633] p23_new = nomsg [L634] p31_old = p31_new [L635] p31_new = nomsg [L636] p32_old = p32_new [L637] p32_new = nomsg [L515] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=-1, m2=-1, m3=-1, max1=127, max2=127, max3=5, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L518] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L564] tmp = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=-1, m2=-1, m3=-1, max1=127, max2=127, max3=5, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L566] return (tmp); [L638] c1 = check() [L650] COND TRUE ! arg VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=-1, m2=-1, m3=-1, max1=127, max2=127, max3=5, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L652] __VERIFIER_error() VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=3, id2=127, id3=5, m1=-1, m2=-1, m3=-1, max1=127, max2=127, max3=5, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 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 233.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -169.1 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.77 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. * Boogie Preprocessor took 21.60 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 1448.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 978.2 MB in the end (delta: 137.2 MB). Peak memory consumption was 261.4 MB. Max. memory is 11.5 GB. * CodeCheck took 238177.79 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 16.3 MB). Free memory was 978.2 MB in the beginning and 870.0 MB in the end (delta: 108.2 MB). Peak memory consumption was 124.5 MB. Max. memory is 11.5 GB. * Witness Printer took 81.14 ms. Allocated memory is still 1.2 GB. Free memory was 870.0 MB in the beginning and 846.0 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...