./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/systemc/toy2_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d421e5ba-1de7-4267-a492-65a2fb26b872/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d421e5ba-1de7-4267-a492-65a2fb26b872/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d421e5ba-1de7-4267-a492-65a2fb26b872/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d421e5ba-1de7-4267-a492-65a2fb26b872/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/systemc/toy2_false-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d421e5ba-1de7-4267-a492-65a2fb26b872/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d421e5ba-1de7-4267-a492-65a2fb26b872/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 c8989412e094655bcf4508d76eb9764ed06d0b34 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 09:55:51,380 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 09:55:51,381 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 09:55:51,390 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 09:55:51,390 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 09:55:51,391 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 09:55:51,392 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 09:55:51,393 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 09:55:51,394 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 09:55:51,395 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 09:55:51,396 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 09:55:51,396 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 09:55:51,397 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 09:55:51,397 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 09:55:51,398 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 09:55:51,399 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 09:55:51,399 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 09:55:51,401 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 09:55:51,402 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 09:55:51,403 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 09:55:51,404 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 09:55:51,405 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 09:55:51,407 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 09:55:51,407 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 09:55:51,407 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 09:55:51,408 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 09:55:51,409 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 09:55:51,409 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 09:55:51,410 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 09:55:51,411 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 09:55:51,411 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 09:55:51,412 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 09:55:51,412 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 09:55:51,412 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 09:55:51,413 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 09:55:51,413 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 09:55:51,413 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d421e5ba-1de7-4267-a492-65a2fb26b872/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 09:55:51,424 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 09:55:51,424 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 09:55:51,425 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 09:55:51,425 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 09:55:51,426 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 09:55:51,426 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 09:55:51,426 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 09:55:51,426 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 09:55:51,426 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 09:55:51,426 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 09:55:51,426 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 09:55:51,427 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 09:55:51,427 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 09:55:51,427 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 09:55:51,427 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 09:55:51,427 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 09:55:51,427 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 09:55:51,427 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 09:55:51,428 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 09:55:51,428 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 09:55:51,428 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 09:55:51,428 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 09:55:51,428 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 09:55:51,428 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 09:55:51,429 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 09:55:51,429 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 09:55:51,429 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 09:55:51,429 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 09:55:51,429 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_d421e5ba-1de7-4267-a492-65a2fb26b872/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 -> c8989412e094655bcf4508d76eb9764ed06d0b34 [2018-11-10 09:55:51,453 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 09:55:51,462 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 09:55:51,465 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 09:55:51,466 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 09:55:51,466 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 09:55:51,467 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d421e5ba-1de7-4267-a492-65a2fb26b872/bin-2019/ukojak/../../sv-benchmarks/c/systemc/toy2_false-unreach-call_false-termination.cil.c [2018-11-10 09:55:51,509 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d421e5ba-1de7-4267-a492-65a2fb26b872/bin-2019/ukojak/data/54440ba39/6af93ae6293f4b1b80e48140f47bb22f/FLAG4e0d00130 [2018-11-10 09:55:51,871 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 09:55:51,872 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d421e5ba-1de7-4267-a492-65a2fb26b872/sv-benchmarks/c/systemc/toy2_false-unreach-call_false-termination.cil.c [2018-11-10 09:55:51,881 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d421e5ba-1de7-4267-a492-65a2fb26b872/bin-2019/ukojak/data/54440ba39/6af93ae6293f4b1b80e48140f47bb22f/FLAG4e0d00130 [2018-11-10 09:55:51,891 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d421e5ba-1de7-4267-a492-65a2fb26b872/bin-2019/ukojak/data/54440ba39/6af93ae6293f4b1b80e48140f47bb22f [2018-11-10 09:55:51,893 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 09:55:51,894 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 09:55:51,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 09:55:51,895 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 09:55:51,898 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 09:55:51,898 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:55:51" (1/1) ... [2018-11-10 09:55:51,900 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b1cfd17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:51, skipping insertion in model container [2018-11-10 09:55:51,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:55:51" (1/1) ... [2018-11-10 09:55:51,907 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 09:55:51,936 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 09:55:52,095 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:55:52,099 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 09:55:52,138 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:55:52,150 INFO L193 MainTranslator]: Completed translation [2018-11-10 09:55:52,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:52 WrapperNode [2018-11-10 09:55:52,150 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 09:55:52,151 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 09:55:52,151 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 09:55:52,151 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 09:55:52,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:52" (1/1) ... [2018-11-10 09:55:52,163 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:52" (1/1) ... [2018-11-10 09:55:52,189 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 09:55:52,190 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 09:55:52,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 09:55:52,190 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 09:55:52,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:52" (1/1) ... [2018-11-10 09:55:52,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:52" (1/1) ... [2018-11-10 09:55:52,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:52" (1/1) ... [2018-11-10 09:55:52,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:52" (1/1) ... [2018-11-10 09:55:52,249 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:52" (1/1) ... [2018-11-10 09:55:52,257 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:52" (1/1) ... [2018-11-10 09:55:52,259 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:52" (1/1) ... [2018-11-10 09:55:52,262 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 09:55:52,262 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 09:55:52,262 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 09:55:52,262 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 09:55:52,263 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d421e5ba-1de7-4267-a492-65a2fb26b872/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 09:55:52,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 09:55:52,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 09:55:53,337 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 09:55:53,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:55:53 BoogieIcfgContainer [2018-11-10 09:55:53,337 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 09:55:53,338 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 09:55:53,338 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 09:55:53,345 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 09:55:53,345 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:55:53" (1/1) ... [2018-11-10 09:55:53,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:55:53,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:53,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 44 states and 71 transitions. [2018-11-10 09:55:53,383 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 71 transitions. [2018-11-10 09:55:53,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 09:55:53,386 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:53,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:55:53,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:53,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 51 states and 85 transitions. [2018-11-10 09:55:53,579 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 85 transitions. [2018-11-10 09:55:53,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 09:55:53,579 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:53,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:55:53,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:53,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 52 states and 88 transitions. [2018-11-10 09:55:53,697 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 88 transitions. [2018-11-10 09:55:53,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 09:55:53,700 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:53,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:55:53,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:53,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 52 states and 87 transitions. [2018-11-10 09:55:53,735 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 87 transitions. [2018-11-10 09:55:53,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 09:55:53,736 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:53,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:55:53,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:53,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 52 states and 86 transitions. [2018-11-10 09:55:53,765 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 86 transitions. [2018-11-10 09:55:53,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 09:55:53,766 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:53,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:55:53,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:53,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 52 states and 85 transitions. [2018-11-10 09:55:53,789 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 85 transitions. [2018-11-10 09:55:53,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 09:55:53,790 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:53,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:55:53,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:53,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 53 states and 85 transitions. [2018-11-10 09:55:53,891 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 85 transitions. [2018-11-10 09:55:53,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 09:55:53,892 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:53,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:53,922 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 09:55:53,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:53,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 55 states and 88 transitions. [2018-11-10 09:55:53,931 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 88 transitions. [2018-11-10 09:55:53,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 09:55:53,932 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:53,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:55:53,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:53,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 60 states and 98 transitions. [2018-11-10 09:55:53,976 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 98 transitions. [2018-11-10 09:55:53,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 09:55:53,977 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:54,038 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:55:54,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:54,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 69 states and 115 transitions. [2018-11-10 09:55:54,366 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 115 transitions. [2018-11-10 09:55:54,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 09:55:54,367 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:54,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:55:54,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:54,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 71 states and 121 transitions. [2018-11-10 09:55:54,527 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 121 transitions. [2018-11-10 09:55:54,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 09:55:54,528 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:54,548 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:55:54,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:54,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 74 states and 127 transitions. [2018-11-10 09:55:54,603 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 127 transitions. [2018-11-10 09:55:54,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 09:55:54,603 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:54,621 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:55:54,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:54,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 75 states and 128 transitions. [2018-11-10 09:55:54,631 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 128 transitions. [2018-11-10 09:55:54,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 09:55:54,632 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:54,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:55:54,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:54,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 75 states and 127 transitions. [2018-11-10 09:55:54,693 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 127 transitions. [2018-11-10 09:55:54,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 09:55:54,693 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:54,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:55:54,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:54,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 78 states and 133 transitions. [2018-11-10 09:55:54,723 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 133 transitions. [2018-11-10 09:55:54,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 09:55:54,723 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:54,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:55:54,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:54,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 83 states and 146 transitions. [2018-11-10 09:55:54,911 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 146 transitions. [2018-11-10 09:55:54,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 09:55:54,911 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:54,928 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 09:55:55,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:55,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 90 states and 156 transitions. [2018-11-10 09:55:55,075 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 156 transitions. [2018-11-10 09:55:55,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 09:55:55,076 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:55,167 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:55:55,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:55,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 96 states and 172 transitions. [2018-11-10 09:55:55,465 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 172 transitions. [2018-11-10 09:55:55,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 09:55:55,466 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:55,485 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:55:55,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:55,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 99 states and 177 transitions. [2018-11-10 09:55:55,653 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 177 transitions. [2018-11-10 09:55:55,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 09:55:55,654 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:55,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:55,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 09:55:55,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:55,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 101 states and 180 transitions. [2018-11-10 09:55:55,689 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 180 transitions. [2018-11-10 09:55:55,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 09:55:55,689 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:55,706 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 09:55:55,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:55,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 107 states and 188 transitions. [2018-11-10 09:55:55,718 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 188 transitions. [2018-11-10 09:55:55,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 09:55:55,719 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:55,787 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:55:55,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:55,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 116 states and 206 transitions. [2018-11-10 09:55:55,980 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 206 transitions. [2018-11-10 09:55:55,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 09:55:55,981 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:55,994 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:55:56,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:56,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 118 states and 210 transitions. [2018-11-10 09:55:56,007 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 210 transitions. [2018-11-10 09:55:56,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 09:55:56,008 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:56,023 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:55:56,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:56,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 118 states and 209 transitions. [2018-11-10 09:55:56,027 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 209 transitions. [2018-11-10 09:55:56,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 09:55:56,028 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:56,043 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:55:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:56,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 118 states and 208 transitions. [2018-11-10 09:55:56,048 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 208 transitions. [2018-11-10 09:55:56,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 09:55:56,049 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:56,065 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:55:56,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:56,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 118 states and 207 transitions. [2018-11-10 09:55:56,073 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 207 transitions. [2018-11-10 09:55:56,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 09:55:56,073 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:56,095 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:55:56,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:56,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 121 states and 213 transitions. [2018-11-10 09:55:56,128 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 213 transitions. [2018-11-10 09:55:56,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 09:55:56,128 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:56,151 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 09:55:56,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:56,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 126 states and 226 transitions. [2018-11-10 09:55:56,273 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 226 transitions. [2018-11-10 09:55:56,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 09:55:56,273 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:56,297 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 09:55:56,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:56,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 131 states and 234 transitions. [2018-11-10 09:55:56,371 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 234 transitions. [2018-11-10 09:55:56,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 09:55:56,372 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:56,399 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 09:55:56,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:56,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 134 states and 237 transitions. [2018-11-10 09:55:56,519 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 237 transitions. [2018-11-10 09:55:56,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 09:55:56,520 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:56,539 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 09:55:56,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:56,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 135 states and 237 transitions. [2018-11-10 09:55:56,545 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 237 transitions. [2018-11-10 09:55:56,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 09:55:56,546 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:56,560 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:55:56,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:56,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 136 states and 237 transitions. [2018-11-10 09:55:56,618 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 237 transitions. [2018-11-10 09:55:56,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 09:55:56,619 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:56,634 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:55:56,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:56,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 137 states and 237 transitions. [2018-11-10 09:55:56,686 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 237 transitions. [2018-11-10 09:55:56,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 09:55:56,687 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:56,702 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:55:56,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:56,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 145 states and 248 transitions. [2018-11-10 09:55:56,766 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 248 transitions. [2018-11-10 09:55:56,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 09:55:56,766 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:56,799 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 09:55:56,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:56,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 149 states and 252 transitions. [2018-11-10 09:55:56,885 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 252 transitions. [2018-11-10 09:55:56,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 09:55:56,885 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:56,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:56,927 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:55:57,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:57,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 161 states and 271 transitions. [2018-11-10 09:55:57,155 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 271 transitions. [2018-11-10 09:55:57,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 09:55:57,156 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:57,177 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 09:55:57,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:57,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 166 states and 275 transitions. [2018-11-10 09:55:57,192 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 275 transitions. [2018-11-10 09:55:57,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-10 09:55:57,193 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:57,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:57,217 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 09:55:57,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:57,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 168 states and 277 transitions. [2018-11-10 09:55:57,295 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 277 transitions. [2018-11-10 09:55:57,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-10 09:55:57,297 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:57,404 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 09:55:57,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:57,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 172 states and 286 transitions. [2018-11-10 09:55:57,663 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 286 transitions. [2018-11-10 09:55:57,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-10 09:55:57,663 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:57,683 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 09:55:57,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:57,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 173 states and 287 transitions. [2018-11-10 09:55:57,752 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 287 transitions. [2018-11-10 09:55:57,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 09:55:57,753 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:57,830 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 09:55:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:58,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 179 states and 300 transitions. [2018-11-10 09:55:58,259 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 300 transitions. [2018-11-10 09:55:58,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 09:55:58,260 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:58,274 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 09:55:58,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:58,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 183 states and 306 transitions. [2018-11-10 09:55:58,542 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 306 transitions. [2018-11-10 09:55:58,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 09:55:58,543 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:58,557 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 09:55:58,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:58,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 184 states and 306 transitions. [2018-11-10 09:55:58,715 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 306 transitions. [2018-11-10 09:55:58,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 09:55:58,716 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:58,735 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 09:55:59,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:59,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 190 states and 315 transitions. [2018-11-10 09:55:59,010 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 315 transitions. [2018-11-10 09:55:59,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 09:55:59,010 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:59,023 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 09:55:59,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:59,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 191 states and 315 transitions. [2018-11-10 09:55:59,154 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 315 transitions. [2018-11-10 09:55:59,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 09:55:59,155 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:59,174 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 09:55:59,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:59,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 193 states and 316 transitions. [2018-11-10 09:55:59,266 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 316 transitions. [2018-11-10 09:55:59,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 09:55:59,267 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:59,281 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 09:55:59,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:55:59,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 193 states and 314 transitions. [2018-11-10 09:55:59,287 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 314 transitions. [2018-11-10 09:55:59,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 09:55:59,287 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:55:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:55:59,421 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 09:56:00,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:00,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 200 states and 330 transitions. [2018-11-10 09:56:00,023 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 330 transitions. [2018-11-10 09:56:00,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 09:56:00,024 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:00,040 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 09:56:00,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:00,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 204 states and 336 transitions. [2018-11-10 09:56:00,395 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 336 transitions. [2018-11-10 09:56:00,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 09:56:00,395 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:00,407 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 09:56:00,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:00,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 208 states and 342 transitions. [2018-11-10 09:56:00,574 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 342 transitions. [2018-11-10 09:56:00,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 09:56:00,575 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:00,588 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 09:56:00,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:00,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 209 states and 342 transitions. [2018-11-10 09:56:00,784 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 342 transitions. [2018-11-10 09:56:00,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 09:56:00,785 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:00,794 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 09:56:00,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:00,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 209 states and 340 transitions. [2018-11-10 09:56:00,799 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 340 transitions. [2018-11-10 09:56:00,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 09:56:00,800 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:00,807 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 09:56:01,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:01,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 216 states and 350 transitions. [2018-11-10 09:56:01,279 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 350 transitions. [2018-11-10 09:56:01,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 09:56:01,280 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:01,287 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 09:56:01,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:01,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 217 states and 350 transitions. [2018-11-10 09:56:01,426 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 350 transitions. [2018-11-10 09:56:01,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 09:56:01,427 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:01,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:01,447 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 09:56:01,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:01,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 221 states and 356 transitions. [2018-11-10 09:56:01,874 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 356 transitions. [2018-11-10 09:56:01,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 09:56:01,875 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:01,893 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 09:56:01,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:01,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 224 states and 358 transitions. [2018-11-10 09:56:01,957 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 358 transitions. [2018-11-10 09:56:01,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 09:56:01,958 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:01,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:01,970 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-10 09:56:02,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:02,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 225 states and 359 transitions. [2018-11-10 09:56:02,065 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 359 transitions. [2018-11-10 09:56:02,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 09:56:02,065 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:02,076 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 09:56:02,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:02,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 225 states and 357 transitions. [2018-11-10 09:56:02,084 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 357 transitions. [2018-11-10 09:56:02,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-10 09:56:02,084 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:02,102 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 09:56:02,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:02,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 226 states and 357 transitions. [2018-11-10 09:56:02,117 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 357 transitions. [2018-11-10 09:56:02,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-10 09:56:02,118 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:02,167 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 09:56:02,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:02,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 233 states and 368 transitions. [2018-11-10 09:56:02,343 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 368 transitions. [2018-11-10 09:56:02,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-10 09:56:02,343 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:02,422 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 09:56:03,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:03,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 241 states and 379 transitions. [2018-11-10 09:56:03,169 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 379 transitions. [2018-11-10 09:56:03,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-10 09:56:03,170 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:03,180 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 09:56:03,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:03,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 242 states and 379 transitions. [2018-11-10 09:56:03,442 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 379 transitions. [2018-11-10 09:56:03,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-10 09:56:03,443 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:03,455 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 09:56:04,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:04,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 250 states and 392 transitions. [2018-11-10 09:56:04,291 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 392 transitions. [2018-11-10 09:56:04,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-10 09:56:04,291 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:04,298 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 09:56:05,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:05,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 258 states and 403 transitions. [2018-11-10 09:56:05,040 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 403 transitions. [2018-11-10 09:56:05,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-10 09:56:05,041 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:05,049 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 09:56:05,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:05,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 262 states and 407 transitions. [2018-11-10 09:56:05,234 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 407 transitions. [2018-11-10 09:56:05,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-10 09:56:05,234 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:05,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:05,243 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 09:56:05,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:05,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 266 states and 411 transitions. [2018-11-10 09:56:05,430 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 411 transitions. [2018-11-10 09:56:05,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-10 09:56:05,430 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:05,463 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 09:56:05,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:05,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 271 states and 416 transitions. [2018-11-10 09:56:05,508 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 416 transitions. [2018-11-10 09:56:05,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-10 09:56:05,509 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:05,550 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 09:56:05,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:05,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 272 states and 416 transitions. [2018-11-10 09:56:05,561 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 416 transitions. [2018-11-10 09:56:05,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-10 09:56:05,561 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:05,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:05,579 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 09:56:05,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:05,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 274 states and 417 transitions. [2018-11-10 09:56:05,802 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 417 transitions. [2018-11-10 09:56:05,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-10 09:56:05,802 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:05,883 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 09:56:06,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:06,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 288 states and 450 transitions. [2018-11-10 09:56:06,855 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 450 transitions. [2018-11-10 09:56:06,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-10 09:56:06,855 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:06,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:06,869 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 09:56:06,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:06,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 291 states and 452 transitions. [2018-11-10 09:56:06,873 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 452 transitions. [2018-11-10 09:56:06,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-10 09:56:06,874 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:06,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:07,014 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:56:07,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:07,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 292 states and 452 transitions. [2018-11-10 09:56:07,123 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 452 transitions. [2018-11-10 09:56:07,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-10 09:56:07,124 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:07,134 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 09:56:07,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:07,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 294 states and 455 transitions. [2018-11-10 09:56:07,288 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 455 transitions. [2018-11-10 09:56:07,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-10 09:56:07,288 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:07,331 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 09:56:07,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:07,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 296 states and 457 transitions. [2018-11-10 09:56:07,349 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 457 transitions. [2018-11-10 09:56:07,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 09:56:07,349 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:07,362 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 09:56:07,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:07,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 297 states and 457 transitions. [2018-11-10 09:56:07,551 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 457 transitions. [2018-11-10 09:56:07,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 09:56:07,551 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:07,568 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 09:56:07,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:07,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 298 states and 457 transitions. [2018-11-10 09:56:07,689 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 457 transitions. [2018-11-10 09:56:07,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 09:56:07,689 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:07,767 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 09:56:08,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:08,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 305 states and 468 transitions. [2018-11-10 09:56:08,161 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 468 transitions. [2018-11-10 09:56:08,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-10 09:56:08,161 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:08,177 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 09:56:08,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:08,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 307 states and 469 transitions. [2018-11-10 09:56:08,471 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 469 transitions. [2018-11-10 09:56:08,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-10 09:56:08,472 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:08,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:08,496 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 09:56:08,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:08,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 308 states and 469 transitions. [2018-11-10 09:56:08,516 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 469 transitions. [2018-11-10 09:56:08,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-10 09:56:08,516 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:08,533 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 09:56:08,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:08,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 311 states and 471 transitions. [2018-11-10 09:56:08,817 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 471 transitions. [2018-11-10 09:56:08,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 09:56:08,818 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:08,860 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 09:56:09,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:09,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 313 states and 470 transitions. [2018-11-10 09:56:09,159 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 470 transitions. [2018-11-10 09:56:09,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 09:56:09,159 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:09,742 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:56:13,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:13,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 349 states and 539 transitions. [2018-11-10 09:56:13,047 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 539 transitions. [2018-11-10 09:56:13,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 09:56:13,047 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:13,096 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:56:13,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:13,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 350 states and 539 transitions. [2018-11-10 09:56:13,376 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 539 transitions. [2018-11-10 09:56:13,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 09:56:13,376 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:13,391 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 09:56:13,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:13,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 357 states and 552 transitions. [2018-11-10 09:56:13,841 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 552 transitions. [2018-11-10 09:56:13,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-10 09:56:13,842 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:13,892 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 20 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 09:56:14,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:14,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 357 states and 550 transitions. [2018-11-10 09:56:14,170 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 550 transitions. [2018-11-10 09:56:14,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-10 09:56:14,171 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:14,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:14,185 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 09:56:14,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:14,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 358 states and 551 transitions. [2018-11-10 09:56:14,197 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 551 transitions. [2018-11-10 09:56:14,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-10 09:56:14,198 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:14,214 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 09:56:14,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:14,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 364 states and 557 transitions. [2018-11-10 09:56:14,496 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 557 transitions. [2018-11-10 09:56:14,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-10 09:56:14,497 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:14,513 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 09:56:15,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:15,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 371 states and 562 transitions. [2018-11-10 09:56:15,272 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 562 transitions. [2018-11-10 09:56:15,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-10 09:56:15,272 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:15,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:16,989 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 1 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:56:21,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:21,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 394 states and 623 transitions. [2018-11-10 09:56:21,817 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 623 transitions. [2018-11-10 09:56:21,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-10 09:56:21,818 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:21,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:22,203 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 1 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:56:23,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:23,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 404 states and 648 transitions. [2018-11-10 09:56:23,454 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 648 transitions. [2018-11-10 09:56:23,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-10 09:56:23,454 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:23,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:25,460 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 21 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:56:31,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:31,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 424 states and 696 transitions. [2018-11-10 09:56:31,499 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 696 transitions. [2018-11-10 09:56:31,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-10 09:56:31,500 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:31,512 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 09:56:32,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:32,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 429 states and 706 transitions. [2018-11-10 09:56:32,132 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 706 transitions. [2018-11-10 09:56:32,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 09:56:32,133 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:32,151 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 09:56:32,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:32,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 430 states and 706 transitions. [2018-11-10 09:56:32,395 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 706 transitions. [2018-11-10 09:56:32,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 09:56:32,396 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:32,436 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 09:56:32,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:32,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 432 states and 707 transitions. [2018-11-10 09:56:32,470 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 707 transitions. [2018-11-10 09:56:32,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 09:56:32,470 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:34,028 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 20 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:56:41,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:41,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 460 states and 791 transitions. [2018-11-10 09:56:41,986 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 791 transitions. [2018-11-10 09:56:41,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 09:56:41,987 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:42,027 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 20 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:56:44,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:44,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 470 states and 815 transitions. [2018-11-10 09:56:44,292 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 815 transitions. [2018-11-10 09:56:44,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-10 09:56:44,293 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:45,724 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 1 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:56:50,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:50,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 481 states and 845 transitions. [2018-11-10 09:56:50,424 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 845 transitions. [2018-11-10 09:56:50,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-10 09:56:50,424 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:50,630 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 1 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:56:52,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:52,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 489 states and 863 transitions. [2018-11-10 09:56:52,841 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 863 transitions. [2018-11-10 09:56:52,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-10 09:56:52,841 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:52,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:52,859 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 09:56:53,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:53,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 490 states and 863 transitions. [2018-11-10 09:56:53,123 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 863 transitions. [2018-11-10 09:56:53,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 09:56:53,123 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:53,139 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-10 09:56:53,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:56:53,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 491 states and 863 transitions. [2018-11-10 09:56:53,333 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 863 transitions. [2018-11-10 09:56:53,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 09:56:53,333 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:56:53,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:56:54,555 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 26 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 09:57:05,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:57:05,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 541 states and 983 transitions. [2018-11-10 09:57:05,253 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 983 transitions. [2018-11-10 09:57:05,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 09:57:05,253 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:57:05,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:57:05,293 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 26 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 09:57:05,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:57:05,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 542 states and 983 transitions. [2018-11-10 09:57:05,820 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 983 transitions. [2018-11-10 09:57:05,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 09:57:05,821 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:57:05,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:57:07,893 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 1 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:57:13,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:57:13,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 556 states and 1045 transitions. [2018-11-10 09:57:13,810 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 1045 transitions. [2018-11-10 09:57:13,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 09:57:13,811 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:57:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:57:18,378 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 25 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:57:30,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:57:30,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 577 states and 1115 transitions. [2018-11-10 09:57:30,787 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 1115 transitions. [2018-11-10 09:57:30,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 09:57:30,788 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:57:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:57:31,313 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 25 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:57:32,512 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2018-11-10 09:57:34,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:57:34,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 590 states and 1147 transitions. [2018-11-10 09:57:34,886 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 1147 transitions. [2018-11-10 09:57:34,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 09:57:34,887 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:57:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:57:35,410 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 25 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:57:38,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:57:38,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 599 states and 1173 transitions. [2018-11-10 09:57:38,921 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1173 transitions. [2018-11-10 09:57:38,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 09:57:38,922 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:57:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:57:41,683 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 26 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:57:44,472 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2018-11-10 09:57:48,342 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2018-11-10 09:57:49,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:57:49,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 611 states and 1213 transitions. [2018-11-10 09:57:49,284 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 1213 transitions. [2018-11-10 09:57:49,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 09:57:49,284 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:57:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:57:49,601 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 26 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:57:49,780 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2018-11-10 09:57:50,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:57:50,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 616 states and 1224 transitions. [2018-11-10 09:57:50,967 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 1224 transitions. [2018-11-10 09:57:50,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 09:57:50,968 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:57:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:57:50,978 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 09:57:52,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:57:52,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 620 states and 1230 transitions. [2018-11-10 09:57:52,062 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 1230 transitions. [2018-11-10 09:57:52,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 09:57:52,063 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:57:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:57:52,074 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 09:57:52,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:57:52,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 623 states and 1234 transitions. [2018-11-10 09:57:52,345 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 1234 transitions. [2018-11-10 09:57:52,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 09:57:52,346 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:57:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:57:52,357 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-10 09:57:52,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:57:52,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 627 states and 1239 transitions. [2018-11-10 09:57:52,650 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 1239 transitions. [2018-11-10 09:57:52,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 09:57:52,651 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:57:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:57:53,043 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-10 09:57:53,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:57:53,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 616 states and 1209 transitions. [2018-11-10 09:57:53,273 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 1209 transitions. [2018-11-10 09:57:53,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-10 09:57:53,274 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:57:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:57:56,229 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 24 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:58:01,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:58:01,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 625 states and 1237 transitions. [2018-11-10 09:58:01,991 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 1237 transitions. [2018-11-10 09:58:01,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-10 09:58:01,991 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:58:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:58:02,697 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 24 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:58:04,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:58:04,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 632 states and 1253 transitions. [2018-11-10 09:58:04,993 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1253 transitions. [2018-11-10 09:58:04,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-10 09:58:04,994 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:58:05,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:58:05,107 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 09:58:07,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:58:07,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 639 states and 1279 transitions. [2018-11-10 09:58:07,143 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 1279 transitions. [2018-11-10 09:58:07,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-10 09:58:07,143 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:58:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:58:07,232 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 09:58:08,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:58:08,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 645 states and 1298 transitions. [2018-11-10 09:58:08,871 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1298 transitions. [2018-11-10 09:58:08,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-10 09:58:08,872 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:58:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:58:08,987 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 09:58:09,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:58:09,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 646 states and 1305 transitions. [2018-11-10 09:58:09,683 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 1305 transitions. [2018-11-10 09:58:09,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-10 09:58:09,683 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:58:09,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:58:09,701 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 09:58:10,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:58:10,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 647 states and 1305 transitions. [2018-11-10 09:58:10,351 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1305 transitions. [2018-11-10 09:58:10,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-10 09:58:10,352 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:58:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:58:14,715 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:58:30,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:58:30,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 673 states and 1398 transitions. [2018-11-10 09:58:30,129 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1398 transitions. [2018-11-10 09:58:30,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-10 09:58:30,129 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:58:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:58:30,200 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:58:31,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:58:31,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 674 states and 1404 transitions. [2018-11-10 09:58:31,248 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1404 transitions. [2018-11-10 09:58:31,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-10 09:58:31,248 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:58:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:58:31,264 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-10 09:58:32,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:58:32,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 678 states and 1414 transitions. [2018-11-10 09:58:32,417 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1414 transitions. [2018-11-10 09:58:32,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-10 09:58:32,418 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:58:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:58:32,428 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-10 09:58:32,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:58:32,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 679 states and 1419 transitions. [2018-11-10 09:58:32,949 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1419 transitions. [2018-11-10 09:58:32,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-10 09:58:32,950 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:58:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:58:32,958 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 09:58:33,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:58:33,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 679 states and 1414 transitions. [2018-11-10 09:58:33,229 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1414 transitions. [2018-11-10 09:58:33,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 09:58:33,230 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:58:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:58:36,415 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:58:42,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:58:42,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 688 states and 1431 transitions. [2018-11-10 09:58:42,041 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1431 transitions. [2018-11-10 09:58:42,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 09:58:42,041 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:58:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:58:42,057 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-10 09:58:42,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:58:42,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 689 states and 1431 transitions. [2018-11-10 09:58:42,448 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1431 transitions. [2018-11-10 09:58:42,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 09:58:42,449 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:58:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:58:46,476 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 24 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:58:59,501 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2018-11-10 09:59:00,796 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2018-11-10 09:59:01,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:01,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 710 states and 1501 transitions. [2018-11-10 09:59:01,858 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1501 transitions. [2018-11-10 09:59:01,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 09:59:01,859 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:02,212 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 24 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:59:03,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:03,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 711 states and 1508 transitions. [2018-11-10 09:59:03,274 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1508 transitions. [2018-11-10 09:59:03,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 09:59:03,274 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:03,558 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 24 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:59:05,915 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2018-11-10 09:59:06,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:06,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 718 states and 1536 transitions. [2018-11-10 09:59:06,624 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1536 transitions. [2018-11-10 09:59:06,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 09:59:06,624 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:06,905 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 24 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:59:07,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:07,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 719 states and 1540 transitions. [2018-11-10 09:59:07,889 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1540 transitions. [2018-11-10 09:59:07,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 09:59:07,889 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:07,906 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-10 09:59:08,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:08,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 720 states and 1540 transitions. [2018-11-10 09:59:08,603 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1540 transitions. [2018-11-10 09:59:08,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 09:59:08,603 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:08,919 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 24 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:59:10,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:10,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 726 states and 1569 transitions. [2018-11-10 09:59:10,673 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1569 transitions. [2018-11-10 09:59:10,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 09:59:10,673 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:16,046 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 25 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:59:23,539 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 70 [2018-11-10 09:59:24,765 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 73 [2018-11-10 09:59:27,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:27,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 742 states and 1612 transitions. [2018-11-10 09:59:27,827 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1612 transitions. [2018-11-10 09:59:27,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 09:59:27,828 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:27,843 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 09:59:28,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:28,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 743 states and 1612 transitions. [2018-11-10 09:59:28,263 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1612 transitions. [2018-11-10 09:59:28,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 09:59:28,264 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:28,701 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 38 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 09:59:30,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:30,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 745 states and 1627 transitions. [2018-11-10 09:59:30,001 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1627 transitions. [2018-11-10 09:59:30,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 09:59:30,001 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:30,393 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 38 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 09:59:32,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:32,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 751 states and 1659 transitions. [2018-11-10 09:59:32,282 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1659 transitions. [2018-11-10 09:59:32,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 09:59:32,282 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:32,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:32,635 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 38 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 09:59:33,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:33,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 752 states and 1660 transitions. [2018-11-10 09:59:33,358 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1660 transitions. [2018-11-10 09:59:33,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 09:59:33,359 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:33,715 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 38 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 09:59:34,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:34,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 753 states and 1664 transitions. [2018-11-10 09:59:34,364 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1664 transitions. [2018-11-10 09:59:34,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 09:59:34,364 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:34,709 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 38 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 09:59:35,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:35,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 754 states and 1668 transitions. [2018-11-10 09:59:35,464 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1668 transitions. [2018-11-10 09:59:35,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 09:59:35,464 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:35,556 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 09:59:36,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:36,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 755 states and 1681 transitions. [2018-11-10 09:59:36,684 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1681 transitions. [2018-11-10 09:59:36,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 09:59:36,685 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:36,777 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 09:59:39,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:39,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 761 states and 1708 transitions. [2018-11-10 09:59:39,771 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1708 transitions. [2018-11-10 09:59:39,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 09:59:39,772 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:39,867 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 09:59:40,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:40,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 766 states and 1721 transitions. [2018-11-10 09:59:40,895 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1721 transitions. [2018-11-10 09:59:40,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 09:59:40,895 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:40,991 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 09:59:41,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:41,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 771 states and 1733 transitions. [2018-11-10 09:59:41,891 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1733 transitions. [2018-11-10 09:59:41,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 09:59:41,891 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:41,985 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 09:59:42,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:42,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 772 states and 1742 transitions. [2018-11-10 09:59:42,863 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1742 transitions. [2018-11-10 09:59:42,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 09:59:42,863 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:44,581 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 54 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 09:59:45,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:45,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 773 states and 1742 transitions. [2018-11-10 09:59:45,526 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1742 transitions. [2018-11-10 09:59:45,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 09:59:45,526 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:45,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:46,309 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 47 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 09:59:46,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:46,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 775 states and 1743 transitions. [2018-11-10 09:59:46,426 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1743 transitions. [2018-11-10 09:59:46,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 09:59:46,427 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:46,447 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-10 09:59:46,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:46,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 776 states and 1743 transitions. [2018-11-10 09:59:46,819 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1743 transitions. [2018-11-10 09:59:46,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 09:59:46,819 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:51,201 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 24 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:59:59,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:59,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 788 states and 1785 transitions. [2018-11-10 09:59:59,607 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1785 transitions. [2018-11-10 09:59:59,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 09:59:59,607 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:59,923 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 24 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:00:00,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:00:00,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 789 states and 1788 transitions. [2018-11-10 10:00:00,932 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1788 transitions. [2018-11-10 10:00:00,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 10:00:00,933 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:00:00,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:01,765 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 60 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 10:00:05,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:00:05,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 795 states and 1811 transitions. [2018-11-10 10:00:05,830 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1811 transitions. [2018-11-10 10:00:05,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 10:00:05,830 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:00:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:05,844 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 10:00:06,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:00:06,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 796 states and 1811 transitions. [2018-11-10 10:00:06,215 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1811 transitions. [2018-11-10 10:00:06,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-10 10:00:06,216 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:00:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:11,375 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 31 proven. 49 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 10:00:16,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:00:16,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 798 states and 1816 transitions. [2018-11-10 10:00:16,677 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1816 transitions. [2018-11-10 10:00:16,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-10 10:00:16,677 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:00:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:17,661 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 31 proven. 49 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 10:00:19,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:00:19,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 804 states and 1844 transitions. [2018-11-10 10:00:19,675 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1844 transitions. [2018-11-10 10:00:19,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-10 10:00:19,676 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:00:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:20,662 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 31 proven. 49 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 10:00:21,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:00:21,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 809 states and 1860 transitions. [2018-11-10 10:00:21,809 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1860 transitions. [2018-11-10 10:00:21,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-10 10:00:21,809 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:00:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:21,824 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 10:00:22,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:00:22,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 809 states and 1851 transitions. [2018-11-10 10:00:22,167 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1851 transitions. [2018-11-10 10:00:22,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-10 10:00:22,168 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:00:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:28,526 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 30 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:00:42,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:00:42,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1883 states to 824 states and 1883 transitions. [2018-11-10 10:00:42,485 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1883 transitions. [2018-11-10 10:00:42,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-10 10:00:42,485 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:00:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:48,090 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 29 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:00:54,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:00:54,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 830 states and 1915 transitions. [2018-11-10 10:00:54,443 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1915 transitions. [2018-11-10 10:00:54,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-10 10:00:54,444 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:00:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:54,454 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-10 10:00:54,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:00:54,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1919 states to 833 states and 1919 transitions. [2018-11-10 10:00:54,984 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1919 transitions. [2018-11-10 10:00:54,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 10:00:54,985 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:00:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:55,065 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 10:00:56,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:00:56,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 834 states and 1936 transitions. [2018-11-10 10:00:56,430 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1936 transitions. [2018-11-10 10:00:56,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 10:00:56,431 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:00:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:57,998 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 57 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 10:01:04,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:01:04,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 849 states and 1966 transitions. [2018-11-10 10:01:04,468 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1966 transitions. [2018-11-10 10:01:04,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 10:01:04,468 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:01:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:01:04,488 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 57 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 10:01:05,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:01:05,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 849 states and 1965 transitions. [2018-11-10 10:01:05,210 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1965 transitions. [2018-11-10 10:01:05,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 10:01:05,211 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:01:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:01:08,044 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 35 [2018-11-10 10:01:11,916 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 30 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:01:26,666 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2018-11-10 10:01:28,310 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2018-11-10 10:01:29,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:01:29,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 867 states and 2020 transitions. [2018-11-10 10:01:29,224 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 2020 transitions. [2018-11-10 10:01:29,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 10:01:29,224 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:01:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:01:30,974 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 30 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:01:32,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:01:32,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2025 states to 868 states and 2025 transitions. [2018-11-10 10:01:32,531 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 2025 transitions. [2018-11-10 10:01:32,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 10:01:32,531 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:01:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:01:32,540 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 10:01:32,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:01:32,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2023 states to 868 states and 2023 transitions. [2018-11-10 10:01:32,954 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 2023 transitions. [2018-11-10 10:01:32,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 10:01:32,954 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:01:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:01:38,405 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 28 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:01:50,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:01:50,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 884 states and 2070 transitions. [2018-11-10 10:01:50,452 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 2070 transitions. [2018-11-10 10:01:50,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 10:01:50,453 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:01:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:01:51,388 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 28 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:01:57,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:01:57,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2103 states to 897 states and 2103 transitions. [2018-11-10 10:01:57,245 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 2103 transitions. [2018-11-10 10:01:57,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 10:01:57,246 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:01:57,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:01:58,351 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 28 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:01:59,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:01:59,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 898 states and 2111 transitions. [2018-11-10 10:01:59,789 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 2111 transitions. [2018-11-10 10:01:59,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 10:01:59,789 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:01:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:02:00,718 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 28 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:02:02,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:02:02,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2123 states to 899 states and 2123 transitions. [2018-11-10 10:02:02,222 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 2123 transitions. [2018-11-10 10:02:02,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 10:02:02,222 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:02:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:02:02,303 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-10 10:02:03,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:02:03,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 904 states and 2133 transitions. [2018-11-10 10:02:03,363 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 2133 transitions. [2018-11-10 10:02:03,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 10:02:03,364 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:02:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:02:03,452 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 10:02:04,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:02:04,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 903 states and 2125 transitions. [2018-11-10 10:02:04,475 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 2125 transitions. [2018-11-10 10:02:04,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 10:02:04,476 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:02:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:02:12,917 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 29 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:02:24,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:02:24,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2151 states to 910 states and 2151 transitions. [2018-11-10 10:02:24,284 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 2151 transitions. [2018-11-10 10:02:24,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 10:02:24,284 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:02:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:02:24,299 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-10 10:02:24,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:02:24,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2151 states to 911 states and 2151 transitions. [2018-11-10 10:02:24,412 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 2151 transitions. [2018-11-10 10:02:24,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 10:02:24,412 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:02:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:02:32,525 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 30 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:02:47,059 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2018-11-10 10:02:48,613 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2018-11-10 10:02:49,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:02:49,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2191 states to 924 states and 2191 transitions. [2018-11-10 10:02:49,982 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 2191 transitions. [2018-11-10 10:02:49,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 10:02:49,982 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:02:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:02:50,860 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 29 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:02:56,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:02:56,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2220 states to 931 states and 2220 transitions. [2018-11-10 10:02:56,478 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 2220 transitions. [2018-11-10 10:02:56,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 10:02:56,479 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:02:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:02:56,836 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 30 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:02:58,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:02:58,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 932 states and 2232 transitions. [2018-11-10 10:02:58,321 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 2232 transitions. [2018-11-10 10:02:58,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 10:02:58,322 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:02:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:02:59,183 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 29 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:03:00,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:03:00,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2238 states to 933 states and 2238 transitions. [2018-11-10 10:03:00,337 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 2238 transitions. [2018-11-10 10:03:00,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 10:03:00,338 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:03:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:03:09,142 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 29 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:03:17,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:03:17,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2247 states to 938 states and 2247 transitions. [2018-11-10 10:03:17,064 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 2247 transitions. [2018-11-10 10:03:17,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 10:03:17,064 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:03:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:03:18,106 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 29 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:03:20,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:03:20,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2268 states to 943 states and 2268 transitions. [2018-11-10 10:03:20,426 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 2268 transitions. [2018-11-10 10:03:20,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 10:03:20,426 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:03:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:03:20,903 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 29 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:03:22,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:03:22,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2274 states to 944 states and 2274 transitions. [2018-11-10 10:03:22,129 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 2274 transitions. [2018-11-10 10:03:22,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 10:03:22,130 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:03:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:03:22,593 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 29 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:03:23,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:03:23,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2289 states to 949 states and 2289 transitions. [2018-11-10 10:03:23,948 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 2289 transitions. [2018-11-10 10:03:23,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 10:03:23,949 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:03:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:03:24,820 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 29 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:03:27,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:03:27,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 955 states and 2299 transitions. [2018-11-10 10:03:27,229 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 2299 transitions. [2018-11-10 10:03:27,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-10 10:03:27,230 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:03:27,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:03:28,192 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 59 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 10:03:29,629 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-10 10:03:32,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:03:32,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2304 states to 958 states and 2304 transitions. [2018-11-10 10:03:32,539 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 2304 transitions. [2018-11-10 10:03:32,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-10 10:03:32,540 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:03:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:03:38,777 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 28 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:03:46,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:03:46,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 964 states and 2320 transitions. [2018-11-10 10:03:46,426 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 2320 transitions. [2018-11-10 10:03:46,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-10 10:03:46,427 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:03:46,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:03:47,684 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 28 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:03:48,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:03:48,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 965 states and 2322 transitions. [2018-11-10 10:03:48,855 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 2322 transitions. [2018-11-10 10:03:48,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-10 10:03:48,856 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:03:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:03:50,171 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 28 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:03:51,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:03:51,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 969 states and 2332 transitions. [2018-11-10 10:03:51,578 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 2332 transitions. [2018-11-10 10:03:51,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-10 10:03:51,578 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:03:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:03:59,593 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 29 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:04:09,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:04:09,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2354 states to 975 states and 2354 transitions. [2018-11-10 10:04:09,248 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 2354 transitions. [2018-11-10 10:04:09,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-10 10:04:09,248 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:04:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:04:10,299 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 29 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:04:11,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:04:11,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 980 states and 2367 transitions. [2018-11-10 10:04:11,678 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 2367 transitions. [2018-11-10 10:04:11,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-10 10:04:11,679 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:04:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:04:12,741 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 29 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:04:13,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:04:13,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2372 states to 981 states and 2372 transitions. [2018-11-10 10:04:13,918 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 2372 transitions. [2018-11-10 10:04:13,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 10:04:13,919 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:04:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:04:20,444 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 28 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:04:33,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:04:33,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 995 states and 2426 transitions. [2018-11-10 10:04:33,225 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 2426 transitions. [2018-11-10 10:04:33,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 10:04:33,226 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:04:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:04:34,107 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 28 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:04:38,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:04:38,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2454 states to 1002 states and 2454 transitions. [2018-11-10 10:04:38,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 2454 transitions. [2018-11-10 10:04:38,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 10:04:38,120 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:04:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:04:39,014 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 28 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:04:40,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:04:40,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 1003 states and 2457 transitions. [2018-11-10 10:04:40,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 2457 transitions. [2018-11-10 10:04:40,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 10:04:40,262 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:04:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:04:41,173 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 28 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:04:42,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:04:42,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2466 states to 1008 states and 2466 transitions. [2018-11-10 10:04:42,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 2466 transitions. [2018-11-10 10:04:42,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 10:04:42,394 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:04:42,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:04:51,164 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 29 proven. 88 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 10:05:02,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:05:02,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2497 states to 1016 states and 2497 transitions. [2018-11-10 10:05:02,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 2497 transitions. [2018-11-10 10:05:02,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 10:05:02,540 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:05:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:05:06,775 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 29 proven. 88 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 10:05:12,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:05:12,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 1027 states and 2523 transitions. [2018-11-10 10:05:12,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 2523 transitions. [2018-11-10 10:05:12,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 10:05:12,626 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:05:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:05:12,638 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 10:05:13,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:05:13,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 1028 states and 2523 transitions. [2018-11-10 10:05:13,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 2523 transitions. [2018-11-10 10:05:13,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 10:05:13,186 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:05:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:05:18,717 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 64 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 10:05:42,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:05:42,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2591 states to 1061 states and 2591 transitions. [2018-11-10 10:05:42,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 2591 transitions. [2018-11-10 10:05:42,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 10:05:42,527 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:05:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:05:42,552 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 64 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 10:05:43,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:05:43,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2591 states to 1062 states and 2591 transitions. [2018-11-10 10:05:43,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 2591 transitions. [2018-11-10 10:05:43,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 10:05:43,746 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:05:43,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:05:52,570 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 28 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:06:01,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:06:01,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2614 states to 1066 states and 2614 transitions. [2018-11-10 10:06:01,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 2614 transitions. [2018-11-10 10:06:01,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 10:06:01,053 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:06:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:06:01,694 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 28 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:06:04,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:06:04,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2638 states to 1072 states and 2638 transitions. [2018-11-10 10:06:04,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 2638 transitions. [2018-11-10 10:06:04,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 10:06:04,640 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:06:04,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:06:05,175 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 28 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:06:06,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:06:06,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2640 states to 1073 states and 2640 transitions. [2018-11-10 10:06:06,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 2640 transitions. [2018-11-10 10:06:06,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 10:06:06,746 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:06:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:06:07,219 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 28 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:06:08,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:06:08,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2662 states to 1077 states and 2662 transitions. [2018-11-10 10:06:08,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 2662 transitions. [2018-11-10 10:06:08,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 10:06:08,849 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:06:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:06:08,889 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 57 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 10:06:08,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:06:08,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 1079 states and 2670 transitions. [2018-11-10 10:06:08,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 2670 transitions. [2018-11-10 10:06:08,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 10:06:08,953 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:06:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:06:19,654 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 29 proven. 91 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 10:06:41,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:06:41,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2725 states to 1091 states and 2725 transitions. [2018-11-10 10:06:41,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 2725 transitions. [2018-11-10 10:06:41,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 10:06:41,675 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:06:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:06:42,970 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 29 proven. 91 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 10:06:48,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:06:48,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2746 states to 1098 states and 2746 transitions. [2018-11-10 10:06:48,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 2746 transitions. [2018-11-10 10:06:48,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 10:06:48,061 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:06:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:06:49,358 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 29 proven. 91 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 10:06:52,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:06:52,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2765 states to 1104 states and 2765 transitions. [2018-11-10 10:06:52,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 2765 transitions. [2018-11-10 10:06:52,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-10 10:06:52,320 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:06:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:06:52,334 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-10 10:06:53,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:06:53,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 1104 states and 2761 transitions. [2018-11-10 10:06:53,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 2761 transitions. [2018-11-10 10:06:53,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-10 10:06:53,302 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:06:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:06:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:06:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:06:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:06:53,488 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 205 iterations. [2018-11-10 10:06:53,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 10:06:53 ImpRootNode [2018-11-10 10:06:53,583 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 10:06:53,583 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:06:53,583 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:06:53,585 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:06:53,586 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:55:53" (3/4) ... [2018-11-10 10:06:53,588 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 10:06:53,693 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d421e5ba-1de7-4267-a492-65a2fb26b872/bin-2019/ukojak/witness.graphml [2018-11-10 10:06:53,693 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:06:53,694 INFO L168 Benchmark]: Toolchain (without parser) took 661800.92 ms. Allocated memory was 1.0 GB in the beginning and 4.9 GB in the end (delta: 3.9 GB). Free memory was 960.2 MB in the beginning and 1.5 GB in the end (delta: -511.6 MB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2018-11-10 10:06:53,695 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:06:53,695 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.39 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 944.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 10:06:53,695 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.35 ms. Allocated memory is still 1.0 GB. Free memory was 944.1 MB in the beginning and 941.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:06:53,695 INFO L168 Benchmark]: Boogie Preprocessor took 72.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.9 MB). Free memory was 941.4 MB in the beginning and 1.2 GB in the end (delta: -246.4 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2018-11-10 10:06:53,696 INFO L168 Benchmark]: RCFGBuilder took 1075.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 165.1 MB). Peak memory consumption was 165.1 MB. Max. memory is 11.5 GB. [2018-11-10 10:06:53,696 INFO L168 Benchmark]: CodeCheck took 660245.08 ms. Allocated memory was 1.2 GB in the beginning and 4.9 GB in the end (delta: 3.7 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -449.0 MB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2018-11-10 10:06:53,696 INFO L168 Benchmark]: Witness Printer took 110.41 ms. Allocated memory is still 4.9 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:06:53,697 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, 137 locations, 1 error locations. UNSAFE Result, 660.1s OverallTime, 205 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 0 SDtfs, 1709077340 SDslu, 246074972 SDs, 0 SdLazy, -1440053366 SolverSat, 165129610 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 427.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 135732 GetRequests, 129329 SyntacticMatches, 3869 SemanticMatches, 2534 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4621824 ImplicationChecksByTransitivity, 642.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 192.6s InterpolantComputationTime, 12168 NumberOfCodeBlocks, 12168 NumberOfCodeBlocksAsserted, 205 NumberOfCheckSat, 11881 ConstructedInterpolants, 0 QuantifiedInterpolants, 7647991 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 204 InterpolantComputations, 114 PerfectInterpolantSequences, 6768/12166 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: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L18] int c ; [L19] int c_t ; [L20] int c_req_up ; [L21] int p_in ; [L22] int p_out ; [L23] int wl_st ; [L24] int c1_st ; [L25] int c2_st ; [L26] int wb_st ; [L27] int r_st ; [L28] int wl_i ; [L29] int c1_i ; [L30] int c2_i ; [L31] int wb_i ; [L32] int r_i ; [L33] int wl_pc ; [L34] int c1_pc ; [L35] int c2_pc ; [L36] int wb_pc ; [L37] int e_e ; [L38] int e_f ; [L39] int e_g ; [L40] int e_c ; [L41] int e_p_in ; [L42] int e_wl ; [L48] int d ; [L49] int data ; [L50] int processed ; [L51] static int t_b ; [L679] int __retres1 ; [L683] e_wl = 2 [L684] e_c = e_wl [L685] e_g = e_c [L686] e_f = e_g [L687] e_e = e_f [L688] wl_pc = 0 [L689] c1_pc = 0 [L690] c2_pc = 0 [L691] wb_pc = 0 [L692] wb_i = 1 [L693] c2_i = wb_i [L694] c1_i = c2_i [L695] wl_i = c1_i [L696] r_i = 0 [L697] c_req_up = 0 [L698] d = 0 [L699] c = 0 [L700] CALL start_simulation() [L390] int kernel_st ; [L393] kernel_st = 0 [L394] COND FALSE !((int )c_req_up == 1) [L405] COND TRUE (int )wl_i == 1 [L406] wl_st = 0 [L410] COND TRUE (int )c1_i == 1 [L411] c1_st = 0 [L415] COND TRUE (int )c2_i == 1 [L416] c2_st = 0 [L420] COND TRUE (int )wb_i == 1 [L421] wb_st = 0 [L425] COND FALSE !((int )r_i == 1) [L428] r_st = 2 [L430] COND FALSE !((int )e_f == 0) [L435] COND FALSE !((int )e_g == 0) [L440] COND FALSE !((int )e_e == 0) [L445] COND FALSE !((int )e_c == 0) [L450] COND FALSE !((int )e_wl == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L455] COND FALSE !((int )wl_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L463] COND FALSE !((int )wl_pc == 2) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L473] COND FALSE !((int )c1_pc == 1) [L482] COND FALSE !((int )c2_pc == 1) [L491] COND FALSE !((int )wb_pc == 1) [L500] COND FALSE !((int )e_c == 1) [L505] COND FALSE !((int )e_e == 1) [L510] COND FALSE !((int )e_f == 1) [L515] COND FALSE !((int )e_g == 1) [L520] COND FALSE !((int )e_c == 1) [L525] COND FALSE !((int )e_wl == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L531] COND TRUE 1 [L534] kernel_st = 1 [L535] CALL eval() [L276] int tmp ; [L277] int tmp___0 ; [L278] int tmp___1 ; [L279] int tmp___2 ; [L280] int tmp___3 ; VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L284] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L286] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L307] COND TRUE (int )wl_st == 0 [L309] tmp = __VERIFIER_nondet_int() [L311] COND TRUE \read(tmp) [L313] wl_st = 1 [L314] CALL write_loop() [L53] int t ; VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L56] COND TRUE (int )wl_pc == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L70] wl_st = 2 [L71] wl_pc = 1 [L72] RET e_wl = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L314] write_loop() [L322] COND TRUE (int )c1_st == 0 [L324] tmp___0 = __VERIFIER_nondet_int() [L326] COND TRUE \read(tmp___0) [L328] c1_st = 1 [L329] CALL compute1() [L127] COND TRUE (int )c1_pc == 0 [L138] COND TRUE 1 [L140] c1_st = 2 [L141] RET c1_pc = 1 [L329] compute1() [L337] COND TRUE (int )c2_st == 0 [L339] tmp___1 = __VERIFIER_nondet_int() [L341] COND TRUE \read(tmp___1) [L343] c2_st = 1 [L344] CALL compute2() [L172] COND TRUE (int )c2_pc == 0 [L183] COND TRUE 1 [L185] c2_st = 2 [L186] RET c2_pc = 1 [L344] compute2() [L352] COND TRUE (int )wb_st == 0 [L354] tmp___2 = __VERIFIER_nondet_int() [L356] COND TRUE \read(tmp___2) [L358] wb_st = 1 [L359] CALL write_back() [L217] COND TRUE (int )wb_pc == 0 [L228] COND TRUE 1 [L230] wb_st = 2 [L231] RET wb_pc = 1 [L359] write_back() [L367] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L284] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L286] COND FALSE !((int )wl_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L289] COND FALSE !((int )c1_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L292] COND FALSE !((int )c2_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L295] COND FALSE !((int )wb_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L298] COND FALSE, RET !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L535] eval() [L537] kernel_st = 2 [L538] COND FALSE !((int )c_req_up == 1) [L549] kernel_st = 3 [L550] COND FALSE !((int )e_f == 0) [L555] COND FALSE !((int )e_g == 0) [L560] COND FALSE !((int )e_e == 0) [L565] COND FALSE !((int )e_c == 0) [L570] COND TRUE (int )e_wl == 0 [L571] e_wl = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L575] COND TRUE (int )wl_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L576] COND TRUE (int )e_wl == 1 [L577] wl_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L593] COND TRUE (int )c1_pc == 1 [L594] COND FALSE !((int )e_f == 1) [L602] COND TRUE (int )c2_pc == 1 [L603] COND FALSE !((int )e_f == 1) [L611] COND TRUE (int )wb_pc == 1 [L612] COND FALSE !((int )e_g == 1) [L620] COND FALSE !((int )e_c == 1) [L625] COND FALSE !((int )e_e == 1) [L630] COND FALSE !((int )e_f == 1) [L635] COND FALSE !((int )e_g == 1) [L640] COND FALSE !((int )e_c == 1) [L645] COND TRUE (int )e_wl == 1 [L646] e_wl = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L650] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L531] COND TRUE 1 [L534] kernel_st = 1 [L535] CALL eval() [L276] int tmp ; [L277] int tmp___0 ; [L278] int tmp___1 ; [L279] int tmp___2 ; [L280] int tmp___3 ; VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L284] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L286] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L307] COND TRUE (int )wl_st == 0 [L309] tmp = __VERIFIER_nondet_int() [L311] COND TRUE \read(tmp) [L313] wl_st = 1 [L314] CALL write_loop() [L53] int t ; VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L56] COND FALSE !((int )wl_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L59] COND FALSE !((int )wl_pc == 2) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L62] COND TRUE (int )wl_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L77] COND TRUE 1 [L79] t = d [L80] data = d [L81] processed = 0 [L82] e_f = 1 [L83] COND TRUE (int )c1_pc == 1 [L84] COND TRUE (int )e_f == 1 [L85] c1_st = 0 [L92] COND TRUE (int )c2_pc == 1 [L93] COND TRUE (int )e_f == 1 [L94] c2_st = 0 [L101] e_f = 2 [L102] wl_st = 2 [L103] wl_pc = 2 [L104] RET t_b = t VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L314] write_loop() [L322] COND TRUE (int )c1_st == 0 [L324] tmp___0 = __VERIFIER_nondet_int() [L326] COND TRUE \read(tmp___0) [L328] c1_st = 1 [L329] CALL compute1() [L127] COND FALSE !((int )c1_pc == 0) [L130] COND TRUE (int )c1_pc == 1 [L145] COND TRUE ! processed [L146] data += 1 [L147] e_g = 1 [L148] COND TRUE (int )wb_pc == 1 [L149] COND TRUE (int )e_g == 1 [L150] wb_st = 0 [L157] e_g = 2 [L138] COND TRUE 1 [L140] c1_st = 2 [L141] RET c1_pc = 1 [L329] compute1() [L337] COND TRUE (int )c2_st == 0 [L339] tmp___1 = __VERIFIER_nondet_int() [L341] COND TRUE \read(tmp___1) [L343] c2_st = 1 [L344] CALL compute2() [L172] COND FALSE !((int )c2_pc == 0) [L175] COND TRUE (int )c2_pc == 1 [L190] COND TRUE ! processed [L191] data += 1 [L192] e_g = 1 [L193] COND TRUE (int )wb_pc == 1 [L194] COND TRUE (int )e_g == 1 [L195] wb_st = 0 [L202] e_g = 2 [L183] COND TRUE 1 [L185] c2_st = 2 [L186] RET c2_pc = 1 [L344] compute2() [L352] COND TRUE (int )wb_st == 0 [L354] tmp___2 = __VERIFIER_nondet_int() [L356] COND TRUE \read(tmp___2) [L358] wb_st = 1 [L359] CALL write_back() [L217] COND FALSE !((int )wb_pc == 0) [L220] COND TRUE (int )wb_pc == 1 [L235] c_t = data [L236] c_req_up = 1 [L237] processed = 1 [L228] COND TRUE 1 [L230] wb_st = 2 [L231] RET wb_pc = 1 [L359] write_back() [L367] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L284] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L286] COND FALSE !((int )wl_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L289] COND FALSE !((int )c1_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L292] COND FALSE !((int )c2_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L295] COND FALSE !((int )wb_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L298] COND FALSE, RET !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L535] eval() [L537] kernel_st = 2 [L538] COND TRUE (int )c_req_up == 1 [L539] COND TRUE c != c_t [L540] c = c_t [L541] e_c = 0 [L545] c_req_up = 0 [L549] kernel_st = 3 [L550] COND FALSE !((int )e_f == 0) [L555] COND FALSE !((int )e_g == 0) [L560] COND FALSE !((int )e_e == 0) [L565] COND TRUE (int )e_c == 0 [L566] e_c = 1 [L570] COND FALSE !((int )e_wl == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L575] COND FALSE !((int )wl_pc == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L583] COND TRUE (int )wl_pc == 2 [L584] COND FALSE !((int )e_e == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L593] COND TRUE (int )c1_pc == 1 [L594] COND FALSE !((int )e_f == 1) [L602] COND TRUE (int )c2_pc == 1 [L603] COND FALSE !((int )e_f == 1) [L611] COND TRUE (int )wb_pc == 1 [L612] COND FALSE !((int )e_g == 1) [L620] COND TRUE (int )e_c == 1 [L621] r_st = 0 [L625] COND FALSE !((int )e_e == 1) [L630] COND FALSE !((int )e_f == 1) [L635] COND FALSE !((int )e_g == 1) [L640] COND TRUE (int )e_c == 1 [L641] e_c = 2 [L645] COND FALSE !((int )e_wl == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L650] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L653] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L656] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L659] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L662] COND TRUE (int )r_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L531] COND TRUE 1 [L534] kernel_st = 1 [L535] CALL eval() [L276] int tmp ; [L277] int tmp___0 ; [L278] int tmp___1 ; [L279] int tmp___2 ; [L280] int tmp___3 ; VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L284] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L286] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L289] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L292] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L295] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L298] COND TRUE (int )r_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L307] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L322] COND FALSE !((int )c1_st == 0) [L337] COND FALSE !((int )c2_st == 0) [L352] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L367] COND TRUE (int )r_st == 0 [L369] tmp___3 = __VERIFIER_nondet_int() [L371] COND TRUE \read(tmp___3) [L373] r_st = 1 [L374] CALL read() [L249] d = c [L250] e_e = 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L251] COND FALSE !((int )wl_pc == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L259] COND TRUE (int )wl_pc == 2 [L260] COND TRUE (int )e_e == 1 [L261] wl_st = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L269] e_e = 2 [L270] RET r_st = 2 [L374] read() [L284] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L286] COND TRUE (int )wl_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L307] COND TRUE (int )wl_st == 0 [L309] tmp = __VERIFIER_nondet_int() [L311] COND TRUE \read(tmp) [L313] wl_st = 1 [L314] CALL write_loop() [L53] int t ; VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L56] COND FALSE !((int )wl_pc == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L59] COND TRUE (int )wl_pc == 2 [L108] t = t_b VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L109] COND FALSE !(d == t + 1) [L113] CALL error() [L13] __VERIFIER_error() VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 256.39 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 944.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.35 ms. Allocated memory is still 1.0 GB. Free memory was 944.1 MB in the beginning and 941.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 72.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.9 MB). Free memory was 941.4 MB in the beginning and 1.2 GB in the end (delta: -246.4 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1075.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 165.1 MB). Peak memory consumption was 165.1 MB. Max. memory is 11.5 GB. * CodeCheck took 660245.08 ms. Allocated memory was 1.2 GB in the beginning and 4.9 GB in the end (delta: 3.7 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -449.0 MB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. * Witness Printer took 110.41 ms. Allocated memory is still 4.9 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...